Docs · C++

C++ API

The C++ wrappers over the cadaclysm library: the reader reads, meshes and writes; the kernel builds exact solids. Every type and call, with the signature as the wrapper declares it — read from its source when this page is built.

Install

Install and load

Three headers under cpp/include/cadaclysm/ in the SDK (include/cadaclysm/ in a release archive): cadaclysm.hpp (the reader, namespace cadaclysm), cadaclysm_blacksmith.hpp (the kernel, cadaclysm::blacksmith) and result.hpp. Header-only: nothing to compile, but you link the libraries. C++17: MSVC 2019+, GCC 9+, Clang 9+.

Get the libraries with the SDK's fetch.py (or unpack a release archive's lib/ and include/); keep the wrapper files and the libraries from the same release. Details on the start page.

# CMake, against an unpacked release archive:
find_package(cadaclysm CONFIG REQUIRED)   # -DCMAKE_PREFIX_PATH=<archive>
target_link_libraries(app PRIVATE cadaclysm::blacksmith)

Where the library is found

Linked at build time: the operating system loads the library CADACLYSM_FLAVOUR picked (below) as it does any shared library — beside the executable on Windows, through the rpath or LD_LIBRARY_PATH on Linux, @rpath on macOS. CADACLYSM_LIBRARY plays no part.

The CMake variable CADACLYSM_FLAVOUR picks the library: full links cadaclysm under cadaclysm::reader, cadaclysm::blacksmith and cadaclysm::cadaclysm; kernel-reader links cadaclysm_kernel_reader under the same three, and a kernel writer or parts call it leaves out fails to link; kernel links cadaclysm_kernel, and linking cadaclysm::reader then fails to generate; reader links cadaclysm_reader, and linking cadaclysm::blacksmith then fails to generate; separate links the cadaclysm_capi and cadaclysm_blacksmith of earlier releases. The default is the release archive's own flavour (full against a build of your own), so find_package needs no flag. cadaclysm::flavour() says which was linked.

The licence

Unlicensed, everything works and a notice is printed on every open and export. A licence file removes it: set CADACLYSM_LICENSE, or put cadaclysm.lic beside the executable or in the working directory, or load it from code with either line below: one call covers the whole library (the two separate libraries of earlier releases need both).

cadaclysm::license("cadaclysm.lic");
cadaclysm::blacksmith::license("cadaclysm.lic");
Quick start

Build a part, then read it back

The kernel builds a plate with a boss, bores it and rounds its corners, then writes STEP — the Examples page's first part:

#include <cadaclysm/cadaclysm_blacksmith.hpp>

#include <cmath>
#include <cstdio>

using namespace cadaclysm::blacksmith;

static cadaclysm::Result<void> build() {
    CADACLYSM_TRY(outline, Profile::rect(120, 80));
    CADACLYSM_TRY(plate, Workplane::xy().extrude(outline, 14).solid());
    CADACLYSM_TRY(circle, Profile::circle(22));
    CADACLYSM_TRY(boss, Workplane::from_solid(plate).faces((Selector::max)(Axis::z)).workplane().extrude(circle, 26).solid());
    CADACLYSM_TRY(joined, plate.join(boss));

    CADACLYSM_TRY(hole, Profile::circle(11));
    CADACLYSM_TRY(rod, Workplane::xy().extrude(hole, 60).solid());
    CADACLYSM_TRY(bore, rod.translate(0, 0, -10));
    CADACLYSM_TRY(bored, joined.cut(bore));

    // The plate's four vertical corners: the lines along Z between two planes
    // (the boss has vertical seams too, but those lie on its cylinder).
    std::vector<std::uint32_t> corners;
    CADACLYSM_TRY(edges, bored.edges());
    for (const Edge& edge : edges) {
        std::optional<Vec3> d = edge.direction();
        bool planes = true;
        for (std::uint32_t f : edge.faces) {
            CADACLYSM_TRY(kind, bored.face_kind(f));
            planes = planes && kind == "plane";
        }
        if (d && std::fabs((*d)[2]) > 0.99 && planes) corners.push_back(edge.index);
    }
    CADACLYSM_TRY(part, bored.fillet(corners, 12));
    return part.step("plate.stp");
}

int main() {
    cadaclysm::Result<void> built = build();
    if (!built) {
        std::fprintf(stderr, "%s\n", built.error().message.c_str());
        return 1;
    }
    return 0;
}

The reader opens that file, walks its tree, meshes what it draws and writes glTF:

#include <cadaclysm/cadaclysm.hpp>

#include <cstdio>
#include <string>

int main() {
    cadaclysm::Result<cadaclysm::Scene> opened = cadaclysm::open("plate.stp");
    if (!opened) {
        std::fprintf(stderr, "%s\n", opened.error().message.c_str());
        return 1;
    }
    const cadaclysm::Scene& scene = *opened;
    std::printf("%s %g m per unit\n", scene.schema().c_str(), scene.metres_per_unit());

    // The tree: assemblies, parts and bodies, parents before children.
    for (const cadaclysm::Node& node : scene.walk()) {
        std::printf("%s%s [%s]\n", std::string(2 * node.depth(), ' ').c_str(), node.label().c_str(), node.kind().c_str());
    }

    // What to draw: every placement of every shape, meshed on first ask.
    for (const cadaclysm::Placement& placement : scene.placements()) {
        cadaclysm::Node geometry = placement.geometry();
        std::printf("%s %u triangles\n", geometry.label().c_str(), geometry.mesh().triangle_count());
    }

    return scene.save("plate.glb", "glb").ok() ? 0 : 1;
}
Reader · cadaclysm_*

Reading, meshing, writing

Module functions

Loading the library, the licence, and opening a file — from disk or from bytes already in memory. Every other object on this page comes out of cadaclysm::open() or cadaclysm::open_memory().

cadaclysm::open()

Result<Scene> open(const std::string& path, const OpenOptions& options = OpenOptions())

Open a CAD file and read its tree. The format comes from the extension (a .zip or .stpZ opens its first readable member — Scene::source_name() says which — and a .gz is read as the format named before it, part.step.gz as .step). The tree is read now and the geometry is built lazily, node by node, when it is first asked for.

convention is the space to read into — a Convention, optionally with the file-units and world-UV flags — and the library converts everything it hands back into it. schema names an extra EXPRESS schema (.exp, or a directory of them); every schema the SDK ships is already built in, so it is needed only for one the library does not carry. colours asks for per-vertex colours on bodies the file painted in more than one colour.

Never returns an empty handle: on failure it returns an Error in its Result carrying the library's reason.

cadaclysm::open_memory()

Result<Scene> open_memory(const void* data, std::size_t size, const std::string& format, const OpenOptions& options = OpenOptions())

Open a file already in bytes — a download, a database blob, an archive member. With no file name to take the format from, it is named as an extension would name it: step, ifc, igs, 3dm, brep, scad, 3mf, ply (a leading dot is fine). The bytes are copied; the buffer can be reused as soon as this returns. Otherwise as cadaclysm::open().

cadaclysm::version()

std::string version()

The version of the library actually loaded — the one worth reporting in a bug.

cadaclysm::flavour()

std::string flavour()

Which library is loaded: "full", "kernel-reader" or "reader" for a flavour of the single cadaclysm library ("kernel" has no reader to ask), and "reader" for the separate cadaclysm_capi of earlier releases. A call the loaded flavour does not have returns an Error in its Result naming the flavour and its features, and saying the full flavour has it.

cadaclysm::features()

std::string features()

The features the loaded library was built with, comma-separated — "nodes,kernel,write-breps,write-meshes,bim,parts" for the full flavour, "nodes,write-meshes" for the reader — and empty for the separate cadaclysm_capi.

cadaclysm::build_date()

std::string build_date()

When the loaded library was built, YYYY-MM-DD. A licence covers every build dated on or before its expiry.

cadaclysm::license()

Result<void> license(const std::string& text_or_path)

Load a licence: the certificate text, or the path of a file holding it. Without this call the library looks in the CADACLYSM_LICENSE environment variable, then for cadaclysm.lic beside the executable and in the working directory. On a licence that does not verify it returns an Error in its Result with the reason, and the previous licence (if any) stays in use.

cadaclysm::license_info()

std::string license_info()

One line about the licence in use — customer=… expiry=… scope=… — or unlicensed (unlicensed -- <reason> when a licence was found but did not verify). Never std::nullopt.

cadaclysm::license_notice_count()

std::uint64_t license_notice_count()

How many unlicensed notices the library has printed to stderr in this process. An application with no console to watch (a GUI, a game) can poll this and show its own banner.

cadaclysm::mesh_formats()

std::vector<MeshFormat> mesh_formats()

Every mesh format Node::save_mesh() writes, with its file extension and a label for a save menu: stl (STL (binary)), stl-ascii (writes .stl too), msh (Gmsh), glb, gltf, obj, usda, 3mf (3D Manufacturing Format), ply (PLY (binary)) and ply-ascii (writes .ply too) in this release. Build the menu from this list rather than hard-coding it, and a format added to the library appears without a code change.

cadaclysm::lod_levels()

std::uint32_t lod_levels()

How many coarser levels Node::mesh_lod() offers above the mesh itself (level 0): 3 in this release.

cadaclysm::formats()

std::vector<Format> formats()

Every format this build reads, each with the file extensions it takes — what an open dialog's filter is built from, the way cadaclysm::mesh_formats() feeds a save menu.

datetime_of

A schedule date (seconds since 1970-01-01T00:00, as WorkSchedule::at() and TaskTime give them) as a naive datetime.

Seconds since 1970-01-01T00:00, no zone: std::chrono::sys_seconds{std::chrono::seconds{static_cast<long long>(seconds)}}.

seconds_of

A naive datetime as a schedule date: seconds since 1970-01-01T00:00, the inverse of datetime_of.

Seconds since 1970-01-01T00:00, no zone: std::chrono::sys_seconds{std::chrono::seconds{static_cast<long long>(seconds)}}.

cadaclysm::pick_save()

std::optional<std::string> pick_save(std::optional<std::string_view> suggested_name = std::nullopt)

Ask the user where to save, through the platform's own dialog, with suggested_name prefilled. std::nullopt when they cancel or no dialog is available. Blocks until the user acts; on macOS call it from the main thread.

cadaclysm::pick_file()

std::optional<std::string> pick_file()

Ask the user for a file through the platform's own open dialog, filtered to what this build can read. std::nullopt when they cancel or no dialog is available (on Linux, neither an XDG portal nor zenity). Blocks until the user acts; on macOS call it from the main thread.

cadaclysm::declared_schema()

Result<std::string> declared_schema(const std::string& model)

The schema a STEP or IFC file says it speaks (its FILE_SCHEMA line), read from the first few kilobytes — cheap even on a very large file. Empty when it names none.

cadaclysm::resolve_schema()

Result<SchemaChoice> resolve_schema(const std::string& model, const std::optional<std::string>& schema)

Which .exp of a schema directory matches a model: the chosen file, or — when the file's declared name resembles none of them — the whole list as fallbacks to try in turn. cadaclysm::open() does this itself when given a directory; this is for a caller that wants to report the choice.

library_path

Where the shared library was found: CADACLYSM_LIBRARY (a file or a directory) first, then beside the wrapper, then a lib/ directory in any parent (the SDK's layout).

Linked at build time: the OS loader finds the libraries; see Install.

cadaclysm::NONE

inline constexpr std::uint32_t NONE = CADACLYSM_NONE

The node index the C API uses for "no such node" (CADACLYSM_NONE, 0xFFFFFFFF). The wrappers turn it into std::nullopt where a node may be missing (Node::parent(), Node::instance_of()), so it matters only when reading raw indices.

OpenOptions C++ only

struct OpenOptions
std::optional<std::string> schema
std::uint32_t convention
bool colors
double source_metres_per_unit
std::uint32_t lightmap_resolution
std::string name

cadaclysm::open() and cadaclysm::open_memory() take Python's keyword arguments as one struct, its fields set by name. convention is a number, so a Convention is OR'd with cadaclysm::FILE_UNITS and cadaclysm::UV_WORLD into it — options.convention = cadaclysm::Convention::unreal | cadaclysm::FILE_UNITS; — and a bare preset is static_cast<std::uint32_t>(cadaclysm::Convention::y_up). name is what an in-memory scene reports as its Scene::path().

packed C++ only

Result<std::uint32_t> packed(std::string_view colour)

cadaclysm::packed(std::string_view): a colour packed 0xRRGGBB from "#rgb", "#rrggbb" or a CSS colour name, read by the library's own parser — for a host that wants the number itself.

SvgColour C++ only

class SvgColour
bool is_text() const
const std::string& text() const
std::int64_t number() const

What Scene::svg()'s stroke and background hold: colour text ("#rgb", "#rrggbb" or a CSS colour name) or a packed 0xRRGGBB, each converting implicitly — options.stroke = "navy";, options.background = 0x000080;. The text is read when the drawing is made, by the reader's parser for a scene and the kernel's for a solid; text it refuses is an Error naming the field.

Scene

class Scene

An open document. Close it when done — Scene::close(), or let the language's scope do it (its destructor, at the end of the scope). Everything it hands back borrows from it: node handles, meshes, polylines. See Lifetimes for what survives a close.

Scene::close()

void close() noexcept

Give the document back. Idempotent. Every mesh and polyline view still held reads freed memory afterwards (the wrappers that can tell refuse to read them). Node and Godot hand back copies, so nothing of theirs goes stale here.

Scene::closed()

bool closed() const noexcept

Whether Scene::close() has run.

Scene::path()

const std::string& path() const

The file it was read from, or the name given to cadaclysm::open_memory().

Scene::schema_path()

const std::optional<std::string>& schema_path() const

The .exp actually used, or std::nullopt — worth reporting when a directory was passed.

Scene::convention()

std::uint32_t convention() const

The convention it was opened with. Nothing the library hands back says what space it is in, and every array out of this scene is in this one.

Scene::version()

std::string version() const

The version of the library that read it.

Scene::schema()

std::string schema() const

The schema the file named, or empty for a format that names none.

Scene::schema_read()

std::string schema_read() const

The schema that actually read it. A file declaring a release candidate reads under the finished schema of the same version where that is what is built in; a file whose schema is unknown reads under the one that defines its entity types.

Scene::substituted()

bool substituted() const

Whether something other than the file's own schema read it — Scene::schema() and Scene::schema_read() differ.

Scene::metres_per_unit()

double metres_per_unit() const

What one length unit in the file is worth in metres; 1 where the file did not say.

Scene::tolerances()

Tolerances tolerances() const

What the file declares about its own precision, as Tolerances: the absolute tolerance in the file's own unit (beside Scene::metres_per_unit(), whatever convention the scene was opened into) and the angular one in radians, each none where the file did not say — a 3dm's units and tolerances, STEP's uncertainty, SAT's resabs, IGES's resolution; other formats declare nothing. Each body read from the file carries a copy, which the kernel's verbs given no tolerance work from.

Scene::bounds()

Bounds bounds() const

Everything the model covers, in world coordinates — the one figure not in a node's own frame. This meshes the whole model, being the only way to know how far it reaches; to frame a view quickly, use the bounds of the nodes already built.

Scene::bounds64()

Bounds64 bounds64() const

Scene::bounds() in double precision, in world coordinates: the model's extent unnarrowed, exact far from the origin. This meshes the whole model, as Scene::bounds() does.

Scene::diagnostics()

std::vector<std::string> diagnostics() const

What the file held that the reader could not build, one line each.

Scene::joints()

std::vector<Joint> joints() const

The connections between those links, in the file's order; each names, through Joint::pair(), how it moves.

Scene::states()

std::vector<State> states() const

The file's named mechanism poses, in file order, each a State. Empty for a file that records none.

Scene::sequences()

std::vector<Sequence> sequences() const

The file's motion sequences — INTERPOLATED_CONFIGURATION_SEQUENCE, a mechanism moving through its states — in file order, each a Sequence. Empty for a file that records none.

Scene::schedules()

std::vector<WorkSchedule> schedules() const

The file's work schedules (IFC 4D: IfcWorkSchedule and the tasks it controls), in file order, each a WorkSchedule. Empty for a file that records none.

Scene::calendars()

std::vector<WorkCalendar> calendars() const

The file's work calendars (IFC 4D: IfcWorkCalendar), in file order, each a WorkCalendar. A task's Task::calendar_index() indexes this list. Empty for a file that records none.

Scene::base()

std::optional<Link> base() const

The link the file declares as the mechanism's base, or std::nullopt when it declares none.

Scene::pose()

Result<Pose> pose(const std::vector<StateValue>& values = {}, std::optional<Link> ground = std::nullopt) const

The mechanism posed by values — rows of a joint and one number per freedom of its pair, in the pair's freedom order, exactly State::values's row type — with ground (a Link, or std::nullopt for the default ground: the declared Scene::base(), else the link on the most joints) held fixed. Values outside a freedom's range are used as given and reported in the answer's Pose::out_of_range. returns an Error in its Result on a bad row or a file with no mechanism, carrying the library's own message.

Scene::pose_state()

Result<Pose> pose_state(const State& state, std::optional<Link> ground = std::nullopt) const

The mechanism posed by a named State's values, ground held fixed as Scene::pose() does. returns an Error in its Result as Scene::pose() does.

Scene::geometry_diagnostics()

std::vector<std::string> geometry_diagnostics() const

What the reader built but the geometry stage could not finish — a face that would not trim, a surface that would not mesh — one line each. Scene::diagnostics() is what the *file* held that could not be read; this is what the geometry did.

Scene::source_name()

std::optional<std::string> source_name() const

The archive member this was read from, or std::nullopt for a plain file.

Scene::nodes()

std::vector<Node> nodes() const

Every node, in index order: assemblies, shapes, layers, storeys — structure as well as geometry. To draw, iterate Scene::placements() instead.

Scene::roots()

std::vector<Node> roots() const

The nodes nothing else contains: where a tree view starts.

Scene::walk()

std::vector<Node> walk() const

Every node reachable from the roots, parents before children.

Scene::query()

Result<std::vector<std::uint32_t>> query(const std::string& filter) const

The indices of the nodes a filter matches, in document order. The filter is one boolean expression in the query language — class == ON_Brep and within(name == Walls). A filter that does not parse returns an Error in its Result with the parser's message and position; one that matches nothing is an empty result, not an error.

Scene::placements()

std::vector<Placement> placements() const

What the document draws, and where. Not the nodes: a block or an instanced part is one node of geometry drawn at several places, and a node walk draws it once at its definition's frame. Iterate this to draw, and the nodes to build a tree. See Placement.

Scene::realize_all()

std::uint32_t realize_all() const

Build every mesh now, across all cores, and return how many were built. Reading is lazy so a tree can be on screen while the shapes are still coming; asking node by node meshes on one core, this uses them all. Watch it from another thread with Scene::realized() and Scene::realize_total(); stop it with Scene::cancel().

Scene::realize_meshes()

std::uint32_t realize_meshes(bool skip_surfaced = true) const

Scene::realize_all(), leaving alone every node that carries surfaces when skip_surfaced is true (the default): a renderer drawing those parts from their surfaces never pays for their triangles, and takes their bounds from Node::bounds(), which falls back to the surfaces.

Scene::realized()

std::uint32_t realized() const

How many nodes Scene::realize_all() has finished. Safe to read from another thread.

Scene::realize_total()

std::uint32_t realize_total() const

How many it will build in all; zero until it starts.

Scene::cancel()

void cancel() const

Ask a running Scene::realize_all() to stop. One-way for the life of the scene: later calls return at once, and meshes are still built one node at a time on request.

Scene::forget_meshes()

void forget_meshes() const

Drop every mesh the scene has built and give the memory back; the next ask rebuilds. For a viewer that has uploaded what it needs. What it frees is the document's own mesh, which Node::mesh64() lends: a view from before it points at freed memory afterwards, so the scene counts its forgets and a Mesh64 read after one is refused as a stale view rather than read. Mesh, Polylines and the Béziers are the library's own caches, which a forget does not touch and which stay good until Scene::close(); Node and Godot hand back copies, unaffected by either.

Scene::save()

Result<void> save(const std::string& path, const std::string& format = "glb") const

Write the whole scene: glb (binary glTF), gltf (text glTF, one file), obj (every placement baked to its own named object, with a .mtl beside it when anything has a colour), usda (an OpenUSD text layer: each shape's triangles once, every placement a prim referencing them, and a node's MaterialX or MDL material — its ExternalStyle.* or MaterialReference.* properties — bound in its own format over a preview of its colour), 3mf (a 3MF package: each shape an object once, every placement a build item with its world matrix, a colour per object), ply (binary little-endian) or ply-ascii (PLY has no tree: every placement baked through its world matrix into one body, a colour a vertex where anything has one), or 3dm (a Rhino file, version 8: each body as its exact brep where the file kept one and as its mesh otherwise, a shape drawn in several places once as a block with a reference at each, layers, names and colours kept; written in the file's own units and axes, so it needs a scene opened in the native convention). Every placement of every shape, named and placed as the tree is, one material per colour; in the scene's convention (use Y-up metres for the space glTF specifies; a USD layer states its up axis and metres per unit). A mechanism moves: in glTF each moving link hangs under a pivot node on its joint, in USD each link is a UsdPhysics rigid body — its mass and inertia summed from its parts at their declared density (water's where the file declares none), its parts colliding in convex pieces — and each pair a joint prim (for a simulator such as Isaac Sim); glb-skinned, gltf-skinned and usda-skinned write it as a skin instead, one bone per link (a UsdSkel skeleton in USD), for engines that move skeletal meshes only. A format outside these, or a failed write, returns an Error in its Result.

Scene::surface_matrix()

Matrix4 surface_matrix() const

The 4×4 that puts Node::surfaces() into the space everything else is already in. Meshes and polylines arrive in the scene's convention; surfaces arrive in the file's own frame, because converting a surface means converting its parameter space too. Identity for a document opened in its native convention and units.

Scene::show()

Result<void> show(const O& options = O{}) const

Draw every visible placement — each block instance where the file puts it — with the viewer in use. Keywords: view= (front, back, left, right, top, bottom, iso), az=, el=, zoom=, up= (default from the convention the scene was opened with), edges= (the B-rep edges over the shapes; on the terminal library, edges=False also hides free curves — the two share one layer there), width=, height=, hint=. No tolerance=: a document is drawn at the tolerance it was read with. With the GPU library (import cadaclysm.view.wgpu) the drawing replaces what one shared window shows and stays live — at the REPL, in IPython and in Jupyter by themselves, in a script until it exits; cadaclysm.view.View draws several items or several windows.

Takes a cadaclysm::ShowOptions (edges true by default, azimuth/elevation/up std::optional). A tolerance is refused: a document is drawn at the tolerance it was read with. Blocks until the window is closed on the wgpu library (cadaclysm::view::use_wgpu()); the terminal prints a still. Several items, text labels (View::show_text) or a window that stays: cadaclysm::View. A member template: #include <cadaclysm/view.hpp> to call it, and link cadaclysm::view_loader (cadaclysm::view is the linked C library, for hosts that call cadaclysm_view.h directly).

Scene::view()

auto view(const O& options = O{}) const

Orbit the model with the viewer in use; returns the camera where it was left — a dict of eye, target, up, orthographic, azimuth and elevation — and pick, what was last clicked (item, node, face) or None. A fresh window, run until closed, with the GPU library.

Takes the options show does; returns a Result<Camera>.

Scene::svg()

Result<void> svg(const std::string& path, const SvgOptions& options = SvgOptions()) const

Every visible placement's wireframe as SVG, from a camera the keywords describe rather than a viewer window: view= (front, back, left, right, top, bottom, iso — Scene::show()'s own table), az=/el= over it, up= (default from the convention this scene was opened with), fov= (0, the default, is orthographic), size= (width, height), margin= (fraction of the content's extent left each side), tolerance= (how far a written curve may stray, in page units), stroke= and background= ("#rgb", "#rrggbb" or a CSS colour name in every language, beside that language's own numeric form; background= std::nullopt for transparent), width= (the stroke's, in page units), edges=, curves=, isocurves=, polylines= (which line sets are drawn; edges by default), and silhouettes= (also draw where each solid's surfaces turn away from the eye — the outline a sphere has no edge for, on by default: a sphere's and a torus's only curves are the seams where their one face meets itself, which are not edges of the body and are never drawn, so without it those two draw a blank page. A line set in its own right, so silhouettes= with edges= off draws the outline alone).

The SVG *is* the drawing, not a picture of one: with path, this writes it to the file and returns std::nullopt; without, it returns the SVG text instead of writing anything. returns an Error in its Result on a refused option (naming the field) or a failed write.

Scene::node C++ only

std::uint32_t size() const
std::optional<Node> node(std::uint32_t index) const

The node count, and one node by index (std::nullopt past the end), without building a list.

Node

class Node

One node of the document — an assembly, a part, a body, a layer, a placement. A handle, not a snapshot: each property asks the scene when read, so nothing goes stale and nothing is built that is never looked at. Names and attributes are cheap; Node::bounds() and Node::mesh() build the geometry.

Node.scene

The scene it belongs to.

Not exposed: keep the Scene you opened.

Node::index()

std::uint32_t index() const noexcept

Its index in the scene, stable while the scene is open: a key for a map of what has been uploaded.

Node::name()

std::string name() const

The name the file gave it, or empty.

Node::id()

std::string id() const

What the file calls it: a STEP #N, an IFC GlobalId, a Rhino object id.

Node::kind()

std::string kind() const

Its type in the file: an IFC class, an openNURBS class, a STEP shape kind.

Node::label()

std::string label() const

Something to put in a tree row: the name, else the kind, else #index.

Node::depth()

std::uint32_t depth() const

How far down the tree it sits; a root is zero.

Node::generator()

std::string generator() const

What its geometry was before it was triangles — brep, mesh, csg — or empty for a node that draws nothing.

Node::visible()

bool visible() const

Whether the file says to show it when opened. The node's own switch, not inherited; true where the format has no such switch.

Node::visible_now()

bool visible_now() const

Node::visible() with every ancestor consulted: a layer switched off hides what hangs under it.

Node::locked()

bool locked() const

Whether the file says it cannot be selected or edited (Rhino's lock, own or by layer). A locked node is still drawn.

Node::parent()

std::optional<Node> parent() const

The node containing this one, or std::nullopt for a root.

Node::children()

std::vector<Node> children() const

The nodes directly under this one.

Node::instance_of()

std::optional<Node> instance_of() const

The node whose geometry this one places, or std::nullopt. A part placed seventy times is one mesh and seventy transforms; this is how a caller knows to upload it once.

Node::select_as()

Node select_as() const

What a click on this node's geometry should select — usually itself. Formats that hang geometry under the object it belongs to (an IFC representation under its product) point back at the object.

Node::attributes()

std::vector<Attribute> attributes() const

Everything the file said about the node, as Attribute values.

Three keys are this library's own, put there by the STEP reader where the file states a body's geometric validation properties: Validation.StatedArea and Validation.StatedVolume, each one number, and Validation.StatedCentroid, a list of three. They are in the document's own length unit — mm and mm² and mm³ on a millimetre part — not SI. They are the sender's claim about the geometry, not a measurement of it: a receiver measures the body itself (Solid::mass() on Solid::from_node()) and compares, and a difference is evidence about the transfer. cadaclysm::blacksmith::set_option()'s step.validation_properties writes them on the way out. Every other key is whatever the file itself carried, and is not documented here.

Node::can_mesh()

bool can_mesh() const

Whether the node has geometry of its own to draw. Builds nothing; most nodes are structure and answer false.

Node::colour()

std::optional<std::array<float, 4>> colour() const

The colour the file gave it as RGBA in 0–1, or std::nullopt — most STEP files carry none, and the caller's default is the right answer.

Node::transform()

Matrix4 transform() const

Where the node's geometry sits: a 4×4 in double precision, composed through every frame above it. Meshes stay single precision in their own frame under a double transform, so a model at survey coordinates keeps its millimetres.

Node::raw_transform()

std::array<double, 16> raw_transform() const

The same matrix as 16 numbers in the C API's column-major order, ready for a GPU uniform.

Node::bounds()

Bounds bounds() const

The extent of the node's geometry in that geometry's own frame. Builds the geometry if needed; carry it through Node::transform() for world coordinates.

Node::bounds64()

Bounds64 bounds64() const

Node::bounds() in double precision: the node's extent in that geometry's own frame, unnarrowed — exact far from the origin, where Node::bounds()'s float32 corners are not. Builds the geometry if needed.

Node::mesh()

Mesh mesh() const

Its triangles in their own frame, built now if they have not been. A node that instances another hands back the instanced node's arrays — the same memory for every placement. The arrays are views into the scene — copies in Node and Godot; see Lifetimes.

Node::mesh64()

Mesh64 mesh64() const

Node::mesh() in double precision: the document's own mesh, lent rather than narrowed — the same indices, Node::mesh()'s positions being exactly these rounded. For a mesh used as geometry (an exporter, a measurement, a solver) far from the origin, where float32 cannot hold the file's coordinates. Where the wrapper hands out views over the scene's memory, forgetting the scene's meshes invalidates them — these lend the document's own mesh, where the float mesh is a copy the library keeps and a forget leaves alone; asked again it is built again. Each one is stamped with the scene's forget count, so reading its arrays after a forget raises a stale view rather than reading freed memory — an array already taken out of it before the forget is not caught.

A checked build counts the scene's forgets and reports a stale view rather than reading freed memory; an unchecked one reads it, as the C ABI says.

Node::fem_mesh()

Result<FemMesh> fem_mesh(double tolerance = 0.01, double max_size = 0.0, const std::optional<std::array<double, 16>>& placement = std::nullopt) const

Its body meshed for a solver, as a FemMesh: nodes welded by bits — two mesh points are one node only where their coordinates are the same doubles, so no tolerance ever merges two distinct points and a crack stays a crack — triangles wound outward, and every node tagged with the lowest-dimension B-rep entity it lies on. Meshed in the part's own frame, following the hop from an instance to the shape it draws that Node::mesh() follows, so a node instanced six times meshes once.

tolerance is the chordal tolerance in model units, and it alone governs how closely the mesh follows the geometry. max_size is a size ceiling, 0 for none (curvature alone): it splits boundary segments to at most that length and lays interior stations max_size / √2 apart as a target, and it adds nodes without refining the boundary geometry — a caller that wants the rim nearer its curve lowers the tolerance, where max_size only makes the elements smaller. FemMesh::longest_edge() is what the mesh actually came to, and the figure to check.

placement is sixteen numbers, in Placement::raw_transform()'s own column-major order — which Node::bounds_placed() takes too, in the wrappers that have it — applied in double precision throughout. The kernel's Solid::fem_mesh() takes twelve instead — an origin and three axes — so a caller moving between the two reformats the placement.

The space is the body's own for a B-rep and the scene's for a mesh, which FemMesh::from_mesh() is the flag for: under a convention other than the native one those are two different spaces, and mixing these nodes with Node::transform() without reading it gives a rotated part.

A cracked body is not a failure: it comes back with FemMesh::watertight() false and its cracks in FemMesh::open_edges() and FemMesh::folded_edges(), and nothing is welded shut to make it look sound. It returns an Error in its Result for a tolerance or size the mesher refuses, a placement that is not sixteen finite and invertible numbers, a node with neither a B-rep nor a mesh (an assembly, a storey, a layer, a curve), and a body that meshes to no triangles at all.

The unlicensed notice is printed here, once, and on neither of the two .msh calls — where the kernel library is the other way round. Read FemMesh::msh_text() before porting either convention onto the other side.

Node::mesh_lod()

Mesh mesh_lod(std::uint32_t level) const

Its triangles at a coarser level of detail: 0 is Node::mesh() itself, 1 up to cadaclysm::lod_levels() each about a quarter of the triangles of the one before, and past that empty. Every level shares the level-0 vertices — the same positions, only the indices differ — so upload the vertices once and switch level by drawing a different index range. Simplifying costs about what meshing did, once per node.

Node::lod_error()

float lod_error(std::uint32_t level) const

How far Node::mesh_lod() at this level moved the surface, in the scene's units — what to pick a level by against the pixel size on screen. Zero at level 0.

Node::lightmap_uvs()

Span<const float> lightmap_uvs() const

A second set of texture coordinates for Node::mesh(), one (u, v) per vertex in the same order, packed into the unit square with no two triangles overlapping — what a baked lightmap needs, where the material coordinates repeat. Asked for when the scene is opened, with a lightmap resolution in texels: each face is one chart, two texels apart and one texel in from the edges at that size. an empty Span<const float> when it was not asked for, for a mesh with no B-rep behind it, and for a body whose charts did not fit at that resolution — the scene's diagnostics say which; open it again larger.

Node::surfaces()

Surfaces surfaces() const

Its faces as exact surfaces plus the trim loops that cut them, each in the surface's own (u, v). Nothing is meshed to produce it, and reading it costs Node::mesh() nothing. Empty where the reader has no parametric description (a tessellated body, a mesh format). In the file's frame — see Scene::surface_matrix().

Node::edges()

Polylines edges() const

Its feature edges as polylines, for an outline overlay. Builds the geometry if needed.

Node::brep()

std::optional<Brep> brep() const

Its exact B-rep, as a Brep, for the kernel's Solid::from_node() to operate on — or std::nullopt where it has none (a mesh, a curve, a CSG body, an OpenSCAD part read without the kernel). Shared with the scene, not copied.

Node::curves()

Polylines curves() const

Its free curves as polylines; a 2D drawing is all of these.

Node::isocurves()

Polylines isocurves() const

Lines ruled across its surfaces, so a curved face reads as curved in a wireframe. A flat face yields its outline, so these can overlap Node::edges().

Node::edge_beziers()

Beziers edge_beziers() const

Its feature edges as cubic Bézier curves, a Beziers — exact where the file's curves were, where Node::edges() are their chords. Builds the geometry if needed.

Node::edge_beziers64()

Beziers64 edge_beziers64() const

Node::edge_beziers() in double precision, kept beside the float Béziers: a forget leaves it valid, unlike Node::mesh64() — in a wrapper that lends views. Node and Godot copy both, so a forget leaves both valid.

Node::curve_beziers()

Beziers curve_beziers() const

Its free curves as cubic Béziers; see Node::edge_beziers().

Node::curve_beziers64()

Beziers64 curve_beziers64() const

Node::curve_beziers() in double precision; see Node::edge_beziers64().

Node::isocurve_beziers()

Beziers isocurve_beziers() const

Its isocurves as cubic Béziers; see Node::edge_beziers().

Node::isocurve_beziers64()

Beziers64 isocurve_beziers64() const

Node::isocurve_beziers() in double precision; see Node::edge_beziers64().

Node::silhouette_beziers()

Result<BeziersData64> silhouette_beziers(const SvgOptions& options = SvgOptions()) const

Where this node's surfaces turn away from the eye, which no edge of it lies on, as rational cubic Béziers in double precision, from the camera the options describe: Node::svg()'s own words, so the words that draw a picture ask about the same eye. tolerance is read as a fraction of the page's width, and nothing else in the options changes the curves; the line-set flags are not read.

A copy, unlike Node::edge_beziers64(). The library keeps one silhouette slot per scene, and the next silhouette call on that scene — for any node — overwrites it, so a view into it would change under a caller who asked twice. The curves are copied out of the slot before the call returns: asking for several nodes' silhouettes in a loop keeps every answer, and a Scene::close() leaves them valid. Calls sharing one scene across threads must be serialised by the caller, as the library documents.

A node with no silhouette — no exact B-rep, or every face planar, a cuboid's — is an empty answer (count 0), not an error. The library clears its error slot as the call starts, so an empty answer leaves no message and a refusal leaves one; that is how the two are told apart, and why a failure from an earlier call cannot be mistaken for this call's empty answer. returns an Error in its Result on a refusal: a refused option, a body with no measurable geometry, or a node that holds no shape of its own (a container above the parts).

Takes a const SvgOptions& (width with tolerance). Returns Result<BeziersData64>, with points, weights and count().

Node::collision()

std::optional<Collision> collision(std::uint32_t hull_budget = 0) const

The collision body for what this node draws, as a Collision: a box, sphere, capsule or cylinder where one fits, else a convex hull. hull_budget is the most triangles a hull may have; 0 (the default) asks for the Unity limit of 255 and is not clamped to it. std::nullopt for a node that draws nothing. Builds the mesh if it is not built; cached per node and budget.

Node::collision_hull()

CollisionHull collision_hull(std::uint32_t hull_budget = 0) const

The convex hull Node::collision() counted, as triangles — a CollisionHull, a view into the scene (a copy in Node and Godot). Empty for a node that draws nothing. Asking the same node for a different hull_budget refits it and frees the hull the earlier call returned: hold one budget.

The surface path

Node::is_meshed()

bool is_meshed() const

Whether its mesh has been built and is held — by Scene::realize_all(), by an ask for it, or by anything else that needed it. A renderer drawing the part from its surfaces checks it never paid for the triangles.

Node::triangle_estimate()

std::int64_t triangle_estimate() const

About how many triangles Node::mesh() would give, without building it — for sizing a budget before meshing. Exact for a stored mesh, within a few tens of percent for a B-rep; -1 where the reader cannot say without doing the work, and for a node that draws nothing. Treat -1 as unknown, never as zero.

Node::bounds_placed()

Bounds bounds_placed(const std::array<double, 16>& placement) const
Bounds bounds_placed() const

The box of what this node draws under a placement (16 numbers, column-major, as Placement::raw_transform(); std::nullopt for the identity), for a part drawn from its surfaces: every sample is carried through the convention and the placement before it is boxed, so it is tighter than placing the corners of Node::bounds(). All zeros for a part with no surfaces.

Node::bounds_placed64()

Bounds64 bounds_placed64(const std::array<double, 16>& placement) const
Bounds64 bounds_placed64() const

Node::bounds_placed() in double precision, from the unnarrowed surface samples; see Node::bounds64().

Node::surface_edges()

Polylines surface_edges() const

Its face boundaries taken from its trimmed surfaces — the outline that costs no tessellation, where Node::edges() meshes the part. In the surfaces' own frame (Scene::surface_matrix()); empty without surfaces. A shared edge appears once from each face.

Node::surface_edge_beziers()

Beziers surface_edge_beziers() const

Its edges as the exact curves, a Beziers, where the part has them without meshing — a Rhino extrusion's rims are its profile — and empty everywhere else. A caller drawing from surfaces tries it before Node::surface_edges(), whose trims are thinned to the mesh tolerance and so cut chords across a curve the surface rounds. The same segments as Node::edge_beziers(), in the scene's space: not the surfaces' frame, so no Scene::surface_matrix().

Node::edge_colours()

std::vector<std::optional<std::array<float, 4>>> edge_colours() const

One RGBA per polyline of Node::edges(), and none for an edge the file does not style; empty when nothing is styled. STEP files carry them as CURVE_STYLE styling.

Node::surface_edge_colours()

std::vector<std::optional<std::array<float, 4>>> surface_edge_colours() const

Node::edge_colours() for Node::surface_edges().

Node::surface_isocurves()

Polylines surface_isocurves() const

Its isocurves taken from its trimmed surfaces and clipped to the trims, without meshing: lines at a surface's bend lines and an even spread where it has none; a flat face gets none. In the surfaces' frame; empty without surfaces.

Node::surface_pick()

std::optional<Vec3> surface_pick(const Vec3& from, const Vec3& to) const

Where a segment first meets this part's surfaces, or std::nullopt. Exact — it answers from the surface and tests the trims at the hit's own (u, v) — and in the surfaces' own frame: carry a ray from the scene's space through the inverse of Scene::surface_matrix() first.

Node::surface_proxy_mesh()

Mesh surface_proxy_mesh(std::uint32_t cells) const

A coarse mesh over its surfaces for the things that need triangles and not a picture — ray tracing, distance fields: each face gridded cells by cells over its trim window, two triangles a cell whose centre lies inside the trims, never welded. Built once per part at the first cells asked for. In the scene's space, like Node::mesh(). Empty without surfaces or for zero cells.

Node::save_mesh()

Result<void> save_mesh(const std::string& path, const std::string& format = "stl") const

Write this node's own mesh — where it is defined, without its placement — in one of cadaclysm::mesh_formats(). A node that draws nothing, or an unknown format, returns an Error in its Result; ask Node::can_mesh() first to grey out a menu entry. To write the whole model, see Scene::save().

Node::walk()

std::vector<Node> walk() const

This node and every node under it, parents before children.

Node::show()

Result<void> show(const O& options = O{}) const

Draw what this node and everything under it places with the viewer in use — shown by handle on its scene, hiding the siblings along the path from the scene's root to this node (each ancestor's own geometry stays visible) and framing this node. Keywords as Scene::show(). With the GPU library (import cadaclysm.view.wgpu) the drawing replaces what one shared window shows and stays live — at the REPL, in IPython and in Jupyter by themselves, in a script until it exits; cadaclysm.view.View draws several items or several windows.

Takes a cadaclysm::ShowOptions (edges true by default, azimuth/elevation/up std::optional). A tolerance is refused: a document is drawn at the tolerance it was read with. Blocks until the window is closed on the wgpu library (cadaclysm::view::use_wgpu()); the terminal prints a still. Several items, text labels (View::show_text) or a window that stays: cadaclysm::View. A member template: #include <cadaclysm/view.hpp> to call it, and link cadaclysm::view_loader (cadaclysm::view is the linked C library, for hosts that call cadaclysm_view.h directly). The shown Node borrows from its Scene: keep the Scene open.

Node::view()

auto view(const O& options = O{}) const

Orbit this node and everything under it; returns the camera where it was left — a dict of eye, target, up, orthographic, azimuth and elevation — and pick, what was last clicked (item, node, face) or None. A fresh window, run until closed, with the GPU library.

Takes the options show does; returns a Result<Camera>.

Node::svg()

Result<void> svg(const std::string& path, const SvgOptions& options = SvgOptions()) const

This node's own wireframe as SVG, in its own frame — Scene::svg()'s keywords, read from just this node rather than every placement. With path, writes the file and returns std::nullopt; without, returns the SVG text. returns an Error in its Result on a refused option (naming the field) or a failed write.

Brep

class Brep

A body's exact B-rep — the trimmed surfaces its mesh is cut from — shared with the scene rather than copied, and held by this object until it is released. It is what Node::brep() hands the kernel's Solid::from_node(), which operates on it without a copy, and it can say whether it is a Manifold. It outlives the scene it came from for as long as anything holds it. In the node's own frame and the file's own units and axes; the kernel library must come from the same release as the reader.

Brep::pointer()

const CadaclysmBrep* pointer() const noexcept

The brep's C pointer, which the kernel's wrapper hands across. returns an Error in its Result once released.

Brep::layout_id()

static std::string layout_id()

How this library lays a brep out in memory: its compiler, target and source. The kernel shares a brep only with a reader whose id equals its own.

Brep::manifold()

Result<Manifold> manifold() const

Whether its faces make a manifold — every edge bordered by one face or two, the faces round every vertex one fan — and whether it is closed, as a Manifold. Read off the topology the file wrote, not a mesh. returns an Error in its Result once released.

Brep::sew()

Result<std::pair<Brep, SewReport>> sew(std::optional<double> tolerance = std::nullopt, std::optional<double> vertex = std::nullopt) const

This brep with its free edges sewn, and what was sewn, as a new Brep and a SewReport; this one is left as it was. Two free edges become one shared edge where both their ends coincide within vertex — by default the rounding Brep::manifold() merges vertices at — and their curves lie within tolerance of each other, by default vertex too, so only edges that are one curve written twice are joined. A larger tolerance also joins two curves between the same two vertices that part by up to it; vertex is what decides which edges are candidates at all, and raising it is what could close a slot. Nothing moves. returns an Error in its Result once released.

Brep::health()

Result<HealthReport> health(std::optional<double> tolerance = std::nullopt, bool mesh = false) const

What is wrong with this brep, as a HealthReport: the free edges and the wires they chain into, each with its nearest partner and the gap to it; the features below tolerance; the loose edges; and what sewing would join and leave. Nothing moves. tolerance is an absolute length, as Rhino's model tolerance is, by default 1e-4 times the diagonal; a NaN, infinite, zero or negative one takes the default, and the report shows what was used. A partner is the nearest free edge other than a neighbour on the wire, so a rim reads as a gap the size of the part; shared_ends 2 is what Brep::sew() joins. mesh=True also meshes the brep and reports where the mesh cracks; an open body's crack census is empty by design (not asked), and cracks are only counted on a closed body. Loose edges are compared against the larger of the tolerance recorded and the one given. returns an Error in its Result once released.

Brep::heal()

Result<std::pair<Brep, HealReport>> heal(std::optional<double> tolerance = std::nullopt, bool edges = true, bool faces = true, bool holes = true) const

This brep with its small features removed, beside a HealReport of what was done and left, as a new Brep; this one is left as it was. It heals what Brep::health() lists as small at the same tolerance, so health first tells what it will do.

Each kind's fix: a short edge's two ends are merged into one vertex and the edge dropped; a collapsed edge (a trim collapsed to a point where its surface is not singular) is dropped; a sliver face's short ends are merged, then the face is dropped and its two long sides sewn into one edge; a tiny face's corners are merged into one vertex and the face is dropped with its edges; a small hole (an inner loop whose edges are all free: a pinhole in an open sheet) is dropped from its face. A hole with walls (a bore) is not a small hole, and a tiny body is listed but never removed.

Everything is a vertex merge no wider than tolerance: a cluster of vertices that spans more, measured by every trim end at them, is refused (chain), so a run of short edges cannot swallow a long one, nor a loosely written corner move an end further. No edit moves a trim further than tolerance: a trim end on a surface pole keeps its uv, an end sent further is left, and a curve edit that would move further is discarded and only the vertex moves. A stack of slivers whose outer faces part by more than tolerance is not sewn across (neighbours_part). Each edge that moved records how far as its Brep::edge_tolerance(), as sewing records a gap; an end that could not move records how far it was left from the merged vertex.

A guard compares the result's health with this brep's. If it is worse — less closed, more free or non-manifold edges, or no faces left — healing retries with the face pass off; if that is still worse, this brep comes back as it was. guarded is set whenever the guard refused a fix. So a lone sliver sheet comes back as a face of two trims: its short ends merged, the sliver refused.

edges, faces and holes switch each kind of fix; a kind switched off is refused as toggled. tolerance std::nullopt, NaN, infinite, zero or negative takes the default, 1e-4 times the diagonal; the report shows what was used. In the browser the reader module's Scene.healed returns the report only: heal the body through the blacksmith module's Solid.heal. returns an Error in its Result once released.

Brep::edge_tolerance()

Result<std::optional<double>> edge_tolerance(std::uint32_t edge) const

How far edge edge (a brep edge id, as a HealFix or FreeEdge names one) may lie off its curve: 0 for an exact edge, the distance healing or sewing moved it where that is recorded, std::nullopt when no trim names the id (an edge healing removed). returns an Error in its Result once released.

Brep::recognize()

Result<std::pair<Brep, RecognizeReport>> recognize(std::optional<double> tolerance = std::nullopt) const

This brep with its free-form surfaces and edge curves given their analytic kind, beside a RecognizeReport of what was taken and left, as a new Brep; this one is left as it was. A NURBS, revolved, extruded or swept surface that is a plane, cylinder, cone, sphere or torus within tolerance of every sample of its faces and every point of their edges becomes exactly that; an edge curve that is a line, circle or ellipse within it likewise, over the same stretch run the same way. So a file that stored its analytic faces as NURBS — a .3dm above all, and many STEP and SAT exports — comes back as it was made, and verbs that read a face's kind (a hole's axis, a fillet's radius) work on it.

Faces and edges keep their numbers, so a face or edge picked before is the same one after. The faces of one surface are taken together or not at all. A face given only by trims in its old surface's parameters (.3dm, IGES) is lifted to space edges first. Volume and area move by no more than the tolerance allows.

tolerance std::nullopt, NaN, infinite, zero or negative takes the default, 1e-6 of the body's extent; the report shows what was used. Not the file's declared tolerance: at a STEP file's usual 0.01, a fillet's blend reads as a torus and the body's area moves by parts in a thousand. In the browser the reader module's Scene.recognized returns the report only: recognise the body through the blacksmith module's Solid.recognize. returns an Error in its Result once released.

Brep::release()

void release() noexcept

Give the reference back now. Leaving a with block, or the garbage collector, does it otherwise.

Placement

class Placement

One drawing of one node's geometry at one place: what Scene::placements() lists. Two drawings of the same shape name the same geometry node, and so the same arrays — upload once, draw twice.

Placement.scene

The scene it belongs to.

Not exposed: keep the Scene you opened.

Placement::index()

std::uint32_t index() const noexcept

Its index in Scene::placements().

Placement::geometry()

Node geometry() const

The node whose mesh, edges and curves this draws.

Placement::select()

Node select() const

What a click on this drawing selects: the placement's own node rather than the shared shape, which would light up every copy.

Placement::transform()

Matrix4 transform() const

Where to draw it: a 4×4, already composed through every frame from the root.

Placement::raw_transform()

std::array<double, 16> raw_transform() const

The same matrix as 16 numbers, column-major.

Joint

class Joint

A connection between two links. Its two ends keep the file's order, not a parent and a child, since a mechanism may be a network with loops.

Joint.scene

The scene this joint belongs to.

Not exposed: keep the Scene you opened.

Joint::index()

std::uint32_t index() const noexcept

Its position in the scene's joints.

Joint::name()

std::string name() const

Its name, as the file gives it.

Joint::start()

Link start() const

The link it starts at.

Joint::end()

Link end() const

The link it ends at.

Joint::pair()

std::optional<Pair> pair() const

How this joint moves: the kinematic pair naming it, a Pair, or std::nullopt when the file gives it none.

Pair

class Pair

A kinematic pair: the kind of relative motion a joint allows between its two links — what Joint::pair() returns.

Pair::kind()

PairKind kind() const noexcept

One of thirteen kinds: revolute, prismatic, cylindrical, spherical, spherical_with_pin, planar, universal, homokinetic, screw, fully_constrained, unconstrained, low_order, other.

Pair::type_name()

std::optional<std::string> type_name() const

For other: the pair's entity type name (GEAR_PAIR). std::nullopt otherwise.

Pair::pitch()

std::optional<double> pitch() const

For screw: its pitch, a length per revolution in the scene's units. std::nullopt otherwise.

Pair::kind_name()

std::string kind_name() const

The kind by name, finer than kind: the same thirteen names, and gear and rack_and_pinion for the two coupled pairs kind reads as other.

Pair::parameters()

std::vector<double> parameters() const

The pair's own numbers, in the order Assembly::pair_with() takes them: screw its pitch, rack_and_pinion its pinion radius, gear its first radius, second radius, ratio (the second link's rotation over the first's, signed), bevel and helical angle — always five. Empty for every other kind.

Pair::frame_start()

Matrix4 frame_start() const

The pair's contact frame fixed in its joint's start link, in world coordinates at the file's rest pose: a 4x4, already composed like Node::transform().

Pair::frame_end()

Matrix4 frame_end() const

The pair's contact frame fixed in its joint's end link.

Pair::raw_frame_start()

std::array<double, 16> raw_frame_start() const

frame_start as 16 numbers, column-major — like Node::raw_transform().

Pair::raw_frame_end()

std::array<double, 16> raw_frame_end() const

frame_end as 16 numbers, column-major.

Pair::freedoms()

std::vector<Freedom> freedoms() const

Its degrees of freedom, in the reader's per-kind order, each a Freedom. A State's values compose in this order.

Freedom

struct Freedom

One degree of freedom of a Pair: which motion, about or along which contact-frame axis, and its optional range. From Pair::freedoms().

Freedom::motion

Motion motion

rotation or translation.

Freedom::axis

FreedomAxis axis

x, y or z: the contact frames' axis the motion is about or along.

Freedom::lower

std::optional<double> lower

The lower limit — radians for a rotation, a length for a translation — or std::nullopt for unbounded.

Freedom::upper

std::optional<double> upper

The upper limit, or std::nullopt for unbounded.

State

struct State

A named pose of the file's mechanism: a MECHANISM_STATE_REPRESENTATION. From Scene::states().

State::index

std::uint32_t index

Its position in the scene's states.

State::name

std::string name

Its name, as the file gives it.

State::values

std::vector<StateValue> values

One row per joint this state sets, in file order: the joint, then one value per freedom of its pair, in the pair's freedom order.

Sequence

struct Sequence

A motion the file records: an INTERPOLATED_CONFIGURATION_SEQUENCE, its states at increasing parameter values. From Scene::sequences().

Sequence::index

std::uint32_t index

Its position in the scene's sequences.

Sequence::name

std::string name

Its name: its representation's, name #2 and on for further sequences in one representation.

Sequence::closed

bool closed

Whether the motion returns to its first segment (its last segment is not discontinuous).

Sequence::seconds_per_unit

std::optional<double> seconds_per_unit

Seconds per unit of the parameter where the file states a time unit, or std::nullopt where it states none (the parameter is then read as seconds).

The seconds rule, to play a sequence on a clock: with a duration, stretch start to end (plus the closing span of a closed sequence, (end - start) divided by one less than the number of segments) over it; with none, seconds are (t - start) times Sequence::seconds_per_unit, or times 1 where it is std::nullopt.

Sequence::segments

std::vector<Segment> segments

The segments, in file order (at least two), each a Segment.

Sequence::start()

double start() const

The first segment's parameter.

Sequence::end()

double end() const

The last segment's parameter (the closing span of a closed sequence not included).

Sequence::pose()

Result<Pose> pose(double t, std::optional<Link> ground = std::nullopt) const

The mechanism posed by this sequence at parameter t, in the file's own parameter: a segment is a keyframe of its state, a discontinuous segment holds until the next and every other kind moves linearly, an open sequence holds its ends and a closed one wraps (its closing span, last back to first, is the mean of its spans, and each joint loops on its own keys, so one that only some segments name still comes back round smoothly). ground is held fixed as Scene::pose() does. returns an Error in its Result for a t that is not finite.

Segment

struct Segment

One step of a Sequence: the state it reaches, its parameter, and how the motion leaves it for the next. From Sequence::segments.

Segment::state

State state

The State this segment reaches.

Segment::t

double t

Its parameter.

Segment::interpolation

std::string interpolation

How the motion leaves it: "undefined", "discontinuous", "synchronous" or "linear".

WorkSchedule

struct WorkSchedule

A building's programme: an IfcWorkSchedule and the tasks it controls. From Scene::schedules(). Dates are seconds since 1970-01-01T00:00 (no time zone); durations and lags are seconds.

WorkSchedule::index

std::uint32_t index

Its position in the scene's schedules.

WorkSchedule::name

std::string name

Its name, else its identification, else schedule #k (k from 1, in file order).

WorkSchedule::identification

std::string identification

Its identification, empty where the file gives none.

WorkSchedule::kind

std::string kind

"planned", "actual", "baseline", "notdefined" or "other".

WorkSchedule::kind_name

std::string kind_name

The text of a user-defined kind (kind is "other"); empty otherwise.

WorkSchedule::start

std::optional<double> start

The schedule's start date, or std::nullopt where the file gives none.

WorkSchedule::finish

std::optional<double> finish

The schedule's finish date, or std::nullopt where the file gives none.

WorkSchedule::tasks()

std::vector<Task> tasks() const

Its tasks, in file order, each a Task.

WorkSchedule::at()

Result<std::vector<ElementState>> at(double date, std::string_view dates = "scheduled") const

What each element this schedule names is doing on date, as ElementState rows in node order; an element no task names is not listed. dates says which of a task's dates to play: "scheduled" (the default) or "actual", where each actual date overrides its scheduled one. A task builds its nodes over its window, or removes them (demolition, dismantling, removal, disposal); summary tasks span their children. A task that works on a WorkCalendar builds over working time only, pausing at nights and weekends. returns an Error in its Result for a date that is not finite, and a dates other than those two words is refused. Each call expands the calendars again: call it when the date changes, not per frame.

Task

struct Task

One task of a WorkSchedule. From WorkSchedule::tasks().

Task.schedule

The WorkSchedule it belongs to.

Not exposed: use schedule_index with the scene's schedules.

Task::schedule_index()

std::uint32_t schedule_index() const

The index of the work schedule this task belongs to (scene.schedules[i]).

Task::index

std::uint32_t index

Its position in its schedule's tasks.

Task::name

std::string name

Its name.

Task::identification

std::string identification

Its identification, empty where the file gives none.

Task::kind

std::string kind

"attendance", "construction", "demolition", "dismantle", "disposal", "installation", "logistic", "maintenance", "move", "operation", "removal", "renovation", "notdefined" or "other".

Task::kind_name

std::string kind_name

The text of a user-defined kind (kind is "other"); empty otherwise.

Task::status

std::string status

Its status as the file writes it, empty where none.

Task::milestone

bool milestone

Whether it is a milestone: an instant, not a span.

Task::parent()

std::optional<Task> parent() const

The summary task nesting it, or std::nullopt for a top-level task.

Task::time

TaskTime time

Its dates, a TaskTime.

Task::nodes()

std::vector<Node> nodes() const

The nodes it builds or removes, each a Node.

Task::calendar_index()

std::optional<std::uint32_t> calendar_index() const

The index of the work calendar this task works on (scene.calendars[i]), or std::nullopt where it has none.

Task::calendar()

std::optional<WorkCalendar> calendar() const

The WorkCalendar this task works on, or std::nullopt where it has none.

TaskTime

struct TaskTime

Every date pair a task gives, in seconds since 1970-01-01T00:00; each is std::nullopt where the file gives none. From Task::time.

TaskTime::schedule_start

std::optional<double> schedule_start

The scheduled start.

TaskTime::schedule_finish

std::optional<double> schedule_finish

The scheduled finish.

TaskTime::early_start

std::optional<double> early_start

The early start.

TaskTime::early_finish

std::optional<double> early_finish

The early finish.

TaskTime::late_start

std::optional<double> late_start

The late start.

TaskTime::late_finish

std::optional<double> late_finish

The late finish.

TaskTime::actual_start

std::optional<double> actual_start

The actual start.

TaskTime::actual_finish

std::optional<double> actual_finish

The actual finish.

TaskTime::duration

std::optional<double> duration

The scheduled duration, in elapsed seconds.

TaskTime::duration_kind

std::optional<std::string> duration_kind

How the file means the duration: "ELAPSEDTIME", "WORKTIME" or "NOTDEFINED"; std::nullopt where the file gives none. A task with a Task::calendar() counts working time unless this is "ELAPSEDTIME"; a task with no calendar always counts elapsed time.

TaskTime::work_duration

std::optional<WorkDuration> work_duration

The duration as working time: that many working days, then that many seconds of working time, as a (days, seconds) pair. std::nullopt for an IFC2X3 task or one with no duration. A year is read as 260 working days, a month as 20, a week as 5 and a day as 1; hours, minutes and seconds are working seconds. So P2DT4H is 2 days and 14400 seconds.

WorkCalendar

struct WorkCalendar

When work happens: an IfcWorkCalendar. From Scene::calendars() or Task::calendar(). A calendar's working time is the union of its working times' occurrences minus the union of its exceptions' (exceptions only ever remove time). A calendar with no working times works every day, all day, less its exceptions. Dates are seconds since 1970-01-01T00:00 (no time zone). The queries refuse, with these messages, a from or to that is not finite (from and to must be finite), a from after to (from must not be after to), a WorkCalendar::working_periods() or WorkCalendar::working_seconds() range longer than 100 years (from and to must lie within 100 years of each other) and a calendar with no working time within 100 years of the date searched (no working time within 100 years).

WorkCalendar::index

std::uint32_t index

Its position in the scene's calendars.

WorkCalendar::name

std::string name

Its name, else its identification, else calendar #k (k from 1, in file order).

WorkCalendar::identification

std::string identification

Its identification, empty where the file gives none.

WorkCalendar::kind

std::string kind

"FIRSTSHIFT", "SECONDSHIFT", "THIRDSHIFT", "NOTDEFINED" or "USERDEFINED".

WorkCalendar::kind_name

std::string kind_name

The text of a user-defined kind (kind is "USERDEFINED"); empty otherwise.

WorkCalendar::working()

std::vector<WorkTime> working() const

Its working times, in file order, each a WorkTime.

WorkCalendar::exceptions()

std::vector<WorkTime> exceptions() const

Its exception (non-working) times, in file order, each a WorkTime.

WorkCalendar::working_periods()

Result<std::vector<std::pair<double, double>>> working_periods(double from, double to) const

The working periods overlapping from..to, clipped to it, sorted and merged so no two touch or overlap: (start, end) pairs of dates, in seconds. returns an Error in its Result for a from or to that is not finite, a from after to, or a range longer than 100 years. Playback uses this to pause a task across nights and weekends; the web build's workingPeriods returns the same pairs as one flat Float64Array.

WorkCalendar::working_seconds()

Result<double> working_seconds(double from, double to) const

The working seconds in from..to. returns an Error in its Result as WorkCalendar::working_periods() does.

WorkCalendar::add_work()

Result<double> add_work(double from, double days, double seconds = 0) const

The date days working days, then seconds of working time, after from (before it, when negative). A forward result that lands at the start of a working day is reported as the end of the previous one, so a ten-day task starting Monday 08:00 on a weekday 08:00-17:00 calendar finishes on the second Friday at 17:00. returns an Error in its Result for a non-finite argument, and for a calendar with no working day within 100 years.

WorkTime

struct WorkTime

A repeating set of working periods, or among a calendar's exceptions of non-working ones, valid between two dates: an IfcWorkTime. From WorkCalendar::working() or WorkCalendar::exceptions().

WorkTime::name

std::string name

Its name, empty where the file gives none.

WorkTime::start

std::optional<double> start

The first day it applies, as that day's midnight (seconds since 1970-01-01T00:00), or std::nullopt for an open start.

WorkTime::finish

std::optional<double> finish

The last day it applies, as that day's midnight (the day itself is included), or std::nullopt for an open end.

WorkTime::pattern

std::optional<Recurrence> pattern

Its Recurrence, or std::nullopt for every day of the range, all day.

Recurrence

struct Recurrence

Which days a WorkTime occurs on and when within each: an IfcRecurrencePattern. From WorkTime::pattern.

Recurrence::kind

std::string kind

The IFC word: "DAILY", "WEEKLY", "MONTHLY_BY_DAY_OF_MONTH", "MONTHLY_BY_POSITION", "BY_DAY_COUNT", "BY_WEEKDAY_COUNT", "YEARLY_BY_DAY_OF_MONTH" or "YEARLY_BY_POSITION".

Recurrence::days

std::vector<std::uint8_t> days

The days of the month, 1 to 31, sorted.

Recurrence::weekdays

std::vector<std::uint8_t> weekdays

The weekdays, 1 (Monday) to 7 (Sunday), sorted.

Recurrence::months

std::vector<std::uint8_t> months

The months, 1 to 12, sorted.

Recurrence::position

std::optional<std::int32_t> position

The position among the month's listed weekdays: 1 to 5 from the month's start, -1 from its end; std::nullopt where the file gives none.

Recurrence::interval

std::optional<std::uint32_t> interval

Every how many days, weeks, months or years; std::nullopt where the file gives none (every one).

Recurrence::occurrences

std::optional<std::uint32_t> occurrences

How many occurring days, counted from the work time's start, before it stops; std::nullopt for no limit.

Recurrence::periods

std::vector<std::pair<double, double>> periods

The working periods within an occurring day, as (start, end) pairs of seconds after midnight, in file order; empty for the whole day.

ElementState

struct ElementState

What one element is doing on a date: WorkSchedule::at()'s rows.

ElementState::node

Node node

The Node.

ElementState::phase

std::string phase

"unbuilt", "building", "built", "demolishing" or "demolished".

ElementState::progress

double progress

How far through the window that governs the phase, 0 to 1: 0 unbuilt, 1 built or demolished.

ElementState::variance

std::optional<double> variance

Seconds late (positive) or early (negative) against the schedule, or std::nullopt where there is none to give.

Pose

struct Pose

A posed mechanism: Scene::pose(), Scene::pose_state() or Sequence::pose()'s answer. The document itself is unchanged. Copied eagerly out of the C handle when it is made, so it borrows nothing and outlives a Scene::close().

Pose::ground

Link ground

The link held fixed.

Pose::unsolved

std::vector<Joint> unsolved

Joints that close a loop and were not honoured, in file order, each a Joint.

Pose::out_of_range

std::vector<std::tuple<Joint, std::uint32_t, double>> out_of_range

One entry per given value that fell outside its freedom's range: the Joint, the freedom's index in its pair, and the value used.

Pose::diagnostics

std::vector<std::string> diagnostics

What the couplings — a gear, a rack and pinion, a screw closing a loop — could not solve, or found disagreeing, in file order, as text in the kernel's words: coupling 'mesh': both 'drive' and 'driven' are given and disagree by 0.1, or coupling 'mesh' cannot be solved: .... Empty when the pose is what was asked: a coupling neither of whose sides is given rests, and one side given drives the other.

Pose::transform()

Matrix4 transform(const Node& node) const

A node's posed transform, in the same form Node::transform() returns.

Pose::raw_transform()

std::array<double, 16> raw_transform(const Node& node) const

The same matrix in the ABI's own column-major order, as 16 numbers.

Pose::show()

Result<void> show(const O& options = O{}) const

Draw this pose's scene with the viewer in use, as Scene::show() does, but with each placement moved by its select node's pose — each node a joint turned draws at its posed transform rather than its rest one. Same keywords as Scene::show().

Takes a cadaclysm::ShowOptions (edges true by default, azimuth/elevation/up std::optional). A tolerance is refused: a document is drawn at the tolerance it was read with. Blocks until the window is closed on the wgpu library (cadaclysm::view::use_wgpu()); the terminal prints a still. Several items, text labels (View::show_text) or a window that stays: cadaclysm::View. A member template: #include <cadaclysm/view.hpp> to call it, and link cadaclysm::view_loader (cadaclysm::view is the linked C library, for hosts that call cadaclysm_view.h directly). The shown Pose borrows from its Scene: keep the Scene open.

Pose::view()

auto view(const O& options = O{}) const

Pose::show()'s orbiting twin; returns what Scene::view() returns — the camera where it was left, and the last pick.

Takes the options show does; returns a Result<Camera>.

Mesh

class Mesh

A node's triangles, in the node's own frame: what Node::mesh() returns. In every wrapper that can lend a view the arrays are read-only views into the scene's memory, not copies — a large assembly is tens of millions of triangles, and most of them go straight to a GPU — and Mesh::copy() makes arrays of your own. Node and Godot copy instead, having no borrowed-view machinery at all: their arrays are theirs already, outlive Scene::close(), and need no copy. The same split as a FemMesh's arrays, and for the same reason.

Mesh::positions()

Span<const float> positions() const

Three floats a vertex.

Mesh::normals()

Span<const float> normals() const

Three floats a vertex, or std::nullopt for a mesh that carries none.

Mesh::uvs()

Span<const float> uvs() const

Two floats a vertex, or std::nullopt: only readers asked for world-scale UVs fill them. One unit of u or v is one world unit, so faces overlap in UV space — a tiling material, not a lightmap.

Mesh::colors()

Span<const float> colors() const

Four floats (RGBA) a vertex, or std::nullopt — the common case. Only a body painted in several colours, opened with colours on, carries them.

Mesh::indices()

Span<const std::uint32_t> indices() const

Three vertex indices a triangle, unsigned 32-bit.

Mesh::vertex_count()

std::uint32_t vertex_count() const

How many vertices.

Mesh::index_count()

std::uint32_t index_count() const

How many indices: three a triangle.

Mesh::triangle_count()

std::uint32_t triangle_count() const

How many triangles.

Mesh::copy()

MeshData copy() const

The same arrays in memory of your own, safe to keep after Scene::close(). Deliberately visible: on a large model this is where the gigabytes go.

Span C++ only

using Span = std::span<T>
class Span

What every array view is: std::span<const T> under C++20, else the same read-only subset of it — data(), size(), empty(), begin()/end(), operator[] and subspan() — so a range-for or an upload call reads it the same way either way.

Polylines

class Polylines

Edges or curves already flattened to points, in the node's own frame: what Node::edges(), Node::curves() and Node::isocurves() return. Views into the scene, like Mesh — copies in Node and Godot, as there.

Polylines::positions()

Span<const float> positions() const

Three floats a point, the runs end to end.

Polylines::counts()

Span<const std::uint32_t> counts() const

How many points each run has, in order.

Polylines::polyline_count()

std::uint32_t polyline_count() const

How many runs.

Polylines::vertex_count()

std::uint32_t vertex_count() const

How many points in all.

Polylines::segment_indices()

std::vector<std::uint32_t> segment_indices() const

Index pairs into the positions, two per line segment — what GL_LINES and every pair-taking API want. Indices rather than points, so a caller can transform the points once and expand afterwards.

Polylines::segments()

std::vector<float> segments() const

The segment endpoints themselves, two points per segment.

Beziers

class Beziers

Edges, curves or isocurves as cubic Bézier curves, exact where the file's curves were: what Node::edge_beziers(), Node::curve_beziers() and Node::isocurve_beziers() return. Views into the scene, like Polylines — copies in Node and Godot, as there.

Beziers::points()

Span<const float> points() const

Four control points a curve, three floats each.

Beziers::weights()

Span<const float> weights() const

A weight per control point: all ones for a polynomial curve, and the weights that make a circular arc exact for a rational one.

Beziers::count()

std::uint32_t count() const

How many curves.

Beziers::copy()

BeziersData copy() const

The same arrays in memory of your own, safe to keep after Scene::close().

Mesh64

class Mesh64

Mesh in double precision, unnarrowed: what Node::mesh64() returns. Positions, normals and uvs keep the file's own precision; colours stay float32, as Mesh::colors() do. Views into the scene's memory, like Mesh — copies in Node and Godot, as there.

Mesh64::positions()

Span<const double> positions() const

Three doubles a vertex.

Mesh64::normals()

Span<const double> normals() const

Three doubles a vertex, or std::nullopt for a mesh that carries none.

Mesh64::uvs()

Span<const double> uvs() const

Two doubles a vertex, or std::nullopt; see Mesh::uvs().

Mesh64::colors()

Span<const float> colors() const

Four floats (RGBA) a vertex, or std::nullopt — always float32, as Mesh::colors() are.

Mesh64::indices()

Span<const std::uint32_t> indices() const

Three vertex indices a triangle, unsigned 32-bit — the same triangles as Mesh::indices().

Mesh64::vertex_count()

std::uint32_t vertex_count() const

How many vertices.

Mesh64::index_count()

std::uint32_t index_count() const

How many indices: three a triangle.

Mesh64::triangle_count()

std::uint32_t triangle_count() const

How many triangles.

Mesh64::copy()

MeshData64 copy() const

The same arrays in memory of your own, safe to keep after a forget or Scene::close().

Beziers64

class Beziers64

Beziers in double precision, unnarrowed: what Node::edge_beziers64(), Node::curve_beziers64() and Node::isocurve_beziers64() return. Views into the scene, like Beziers — copies in Node and Godot, as there.

Beziers64::points()

Span<const double> points() const

Four control points a curve, three doubles each.

Beziers64::weights()

Span<const double> weights() const

A weight per control point, as doubles.

Beziers64::count()

std::uint32_t count() const

How many curves.

Beziers64::copy()

BeziersData64 copy() const

The same arrays in memory of your own, safe to keep after Scene::close().

Bounds64

struct Bounds64

Bounds in double precision, unnarrowed: what Node::bounds64(), Node::bounds_placed64() and Scene::bounds64() return.

Bounds64::min

std::array<double, 3> min

The low corner.

Bounds64::max

std::array<double, 3> max

The high corner.

Bounds64::is_empty()

bool is_empty() const noexcept

Whether this is the all-zero box that stands for nothing.

Bounds64::size()

std::array<double, 3> size() const noexcept

The extent along each axis.

Bounds64::centre()

std::array<double, 3> centre() const noexcept

The midpoint.

Collision and CollisionHull

struct Collision

What Node::collision() found: shape (0 none, 1 box, 2 sphere, 3 capsule, 4 cylinder, 5 hull, named by shape_name), confidence, the axis a capsule or cylinder runs along, frame (16 numbers, column-major) and half_extent — always the true oriented box — radius, height, the fit's error, and the hull's vertex and index counts. Plain data, copied out of the scene. Node::collision_hull() is the hull itself: positions (three floats a vertex) and indices (three a triangle), views into the scene — copies in Node and Godot.

Collision::shape_name()

std::string_view shape_name() const noexcept

none, box, sphere, capsule, cylinder or hull.

Collision::error

double error

How far the fitted shape strays from the mesh, in the scene's units; zero for an exact fit.

Collision::frame

std::array<double, 16> frame

The oriented box's frame, 16 numbers column-major.

Collision::half_extent

std::array<double, 3> half_extent

Half the oriented box's size along its own three axes.

Collision

struct Collision
std::uint32_t shape
std::uint32_t confidence
std::uint32_t axis
double radius
double height
std::uint32_t hull_vertex_count
std::uint32_t hull_index_count

shape, confidence, axis, radius, height, hull_vertex_count and hull_index_count, alongside frame, half_extent, error and shape_name.

CollisionHull

class CollisionHull
Span<const float> positions() const
Span<const std::uint32_t> indices() const
std::uint32_t vertex_count() const
std::uint32_t index_count() const

The hull's positions, indices, vertex_count and index_count.

Meshlets

class Meshlets

A mesh split into meshlets, optionally with coarser levels above them, for a mesh-shader or meshlet-based renderer. Built from any mesh — a Node::mesh() or arrays of your own — and owned by you: free it, or let the language's scope do it (see Lifetimes).

Meshlets::build()

static Result<Meshlets> build(Span<const float> positions, Span<const float> normals, Span<const std::uint32_t> indices, std::uint32_t max_triangles, std::uint32_t max_vertices, std::int32_t levels = 0)

Split positions (three floats a vertex), normals (the same, or none) and indices (three a triangle) into meshlets of at most max_triangles and max_vertices each. The limits are the consumer's own, with no default: Nanite takes 128 and 256, a mesh-shader pipeline 124 and 64, and the vertex cap is the one that bites. levels above 0 groups and simplifies each level into the next until one meshlet is left; Meshlets::level() and a meshlet's children say which is which. A budget of zero, or arrays whose lengths do not agree, returns an Error in its Result before the library is called.

Meshlets::count()

std::uint32_t count() const

How many meshlets, every level counted.

Meshlets::triangle_count()

std::uint32_t triangle_count(std::uint32_t i) const

How many triangles meshlet i has.

Meshlets::vertex_count()

std::uint32_t vertex_count(std::uint32_t i) const

How many vertices meshlet i has.

Meshlets::level()

std::uint32_t level(std::uint32_t i) const

0 for a leaf over the mesh itself, higher for a simplified level above it.

Meshlets::group()

std::uint32_t group(std::uint32_t i) const

Which group of a levelled build meshlet i belongs to.

Meshlets::error()

float error(std::uint32_t i) const

How far meshlet i's level moved the surface; zero at level 0.

Meshlets::child_count()

std::uint32_t child_count(std::uint32_t i) const

How many finer meshlets sit below meshlet i.

Meshlet

struct Meshlet
std::uint32_t index
std::uint32_t level
std::uint32_t group
float error
std::uint32_t vertex_count() const noexcept
std::uint32_t triangle_count() const noexcept
std::vector<float> positions
std::vector<float> normals
std::vector<std::uint32_t> indices
std::vector<std::uint32_t> children
Meshlet meshlet(std::uint32_t i) const

One meshlet's arrays and numbers, copied out: index, level, group, error, vertex_count, triangle_count, positions, normals (zeros where the mesh had none), indices (into the meshlet's own vertices) and children. The arrays are yours.

Meshlets::free()

void free() noexcept

Give the meshlets back. Idempotent; the collector or scope does it otherwise.

Meshlets::freed()

bool freed() const noexcept

Whether Meshlets::free() has run.

FemMesh

class FemMesh

One body meshed for a solver: nodes welded by bits, triangles wound outward, every node tagged with the lowest-dimension B-rep entity it lies on, and every crack reported rather than closed. What Node::fem_mesh() returns, and owned by you: free it, or let the language's scope do it (see Lifetimes).

A handle rather than a snapshot. In every wrapper that can lend a view, the big arrays are read-only views into the library's own memory, as Node::mesh()'s are and for the same reason — a solver mesh is megabytes, and copying it to hand it over would cost that twice. Node and Godot copy instead, having no borrowed-view machinery at all, so for those two the array is theirs and everything below about a stale view falls away. Either way the owner of the memory is this object rather than the scene: Scene::close() neither frees a FEM mesh nor stales one, and meshing the body again does not either. Only FemMesh::free() does, or the language's own scope or collector reclaiming the handle.

So keep the FEM mesh itself reachable for as long as you read a view of it, and copy anything that must outlive it. What refuses a stale read is a different mechanism in each language, so all ten are named here rather than a rule with an "otherwise" in it. Swift's view type carries its owner and asks it before every element, so the read itself is refused — it traps inside the subscript getter, measured in a release build. Rust settles it before the program runs: its free takes the mesh by value, so a slice can neither be asked for after it nor held across it. Godot and Node hand back copies, so there is nothing of the library's left to go stale. Python, C#, Java and C++ check the handle in the accessor, so a view asked for after the free is refused and one already in hand is a bare array, span or buffer that reads freed memory — measured in C#, where a span taken before the free read the body's own coordinates out of the freed block. Python's numpy array does hold the mesh, which keeps it reachable (below), but nothing asks the mesh when the array is read, so one kept past an explicit free() dangles as C#'s span does. Go's and LuaJIT's arrays are fields filled when the mesh was built rather than accessors, so neither moment is refused there; their methods are, and for those two this is documented rather than enforced, as their own module headers already do for the scene.

Staying reachable is a second question, and a narrower one. In C#, Java, Go and LuaJIT the view is the platform's own array type with nowhere to hold a reference back to the handle, so a program that keeps a view and lets go of the mesh can have the collector free the handle under it with nothing ever calling FemMesh::free() — measured in C#, Java and Go. C++ has no collector but the same shape at scope end: the mesh's destructor frees the handle when it goes out of scope, and a Span kept past that reads freed memory. A view type that carries its owner is safe from that (Python's, Swift's), and so is a language that rules the case out — Rust borrows the mesh for the view's lifetime, Godot and Node copy. The same rule as Solid::mesh()'s own views.

FemMesh::nodes()

Span<const double> nodes() const

Every node's position, three doubles each, placed by Node::fem_mesh()'s placement and in the space FemMesh::from_mesh() names. Every node is used by at least one triangle.

The five arrays are Spans into the handle's own memory, and every accessor here checks the handle in both modes — not only under CADACLYSM_CHECKED, as the scene's and the solid's views do, because what it guards is a pointer handed to C, the way Meshlets' own check does, rather than a borrowed view's owner. So a call on a freed mesh — an array, a count, or either .msh call — goes to CADACLYSM_BAD_ACCESS rather than returning an Error, even in a release build. A Span already in hand is a pointer and a length from then on, and reading one after free() — or after the FemMesh itself went out of scope — reads freed memory in either mode: measured on a body away from the origin, it still gave that body's own coordinates until the block was reused. So hold the FemMesh while you read a span, and copy (std::vector<double>(mesh.nodes().begin(), mesh.nodes().end())) anything that must outlive it. FemEdge's nodes and runs borrow the same way.

FemMesh::triangles()

Span<const std::uint32_t> triangles() const

Three node indices a triangle, wound outward — a mirroring placement is wound back.

FemMesh::triangle_face()

Span<const std::uint32_t> triangle_face() const

Which B-rep face each triangle lies on, one per triangle, into the body's FemMesh::face_count() faces.

FemMesh::node_kind()

Span<const std::uint32_t> node_kind() const

What each node lies on — 0 a B-rep vertex, 1 an edge, 2 a face — one per node: the lowest-dimension entity it lies on, which is the .msh format's own classification rule. FemMesh::node_entity() says which entity of that kind.

FemMesh::node_entity()

Span<const std::uint32_t> node_entity() const

Which vertex, edge or face each node lies on, read by the matching FemMesh::node_kind(): an index into FemMesh::vertices(), into FemMesh::edges(), or into the body's faces.

FemMesh::face_count()

std::uint32_t face_count() const

The body's faces; FemMesh::triangle_face() and a FemMesh::node_kind() of 2 index them.

FemMesh::edges()

Result<std::vector<FemEdge>> edges() const

One FemEdge per B-rep edge, in the order a FemMesh::node_kind() of 1 indexes them. Empty for a FemMesh::from_mesh() body, which has no B-rep edges at all.

FemEdge

struct FemEdge
std::uint32_t id
Span<const std::uint32_t> nodes
Span<const std::uint32_t> runs
std::pair<std::uint32_t, std::uint32_t> faces
std::pair<std::uint32_t, std::uint32_t> ends
bool closed
bool seam
std::vector<Span<const std::uint32_t>> chains() const

One B-rep edge's chain of nodes, and where that chain breaks. nodes are this mesh's node indices in order along the edge, its end vertices included. runs says where the chain breaks: each entry is a start offset into nodes, and the nodes from one offset up to the next — the last offset running to the end — are a polyline of their own, with nothing joining across a boundary. The two ends either side of a boundary are two points of the edge with no mesh edge between them, a crack along the edge or a stretch of it sampled on one face only. (0,) is the ordinary answer, and a caller reading nodes as one polyline without looking here jumps the gap silently.

faces is (face_a, face_b) and ends is (end_a, end_b), the second of each a sentinel where there is none — an open body's rim, or both ends at one vertex. 0 is a real face and a real vertex, not a sentinel. Which end comes first is the first trim's direction and means nothing else: the pair bounds the edge, it does not orient it. closed where the nodes make one loop, never with more than one run; seam where one face bounds the edge twice, and both faces are then that same face.

id is the body's own edge id, not this mesh's edge index: FemMesh::edges() is a densely renumbered subset of the body's edges, ascending by id, with every edge collapsed to a point left out, so edge 0 of a STEP body's mesh routinely has an id in the hundreds. Everything else that names an edge means the index — a FemMesh::node_kind() of 1 read through FemMesh::node_entity(), the third number of a FemMesh::open_edges() or FemMesh::folded_edges() row, and the edge_<i> physical group of FemMesh::msh_text() — and this is the one way back from any of them to the topology the file wrote.

FemMesh::vertices()

Result<std::vector<FemVertex>> vertices() const

One FemVertex per B-rep vertex, in the order a FemMesh::node_kind() of 0 indexes them. Empty for a FemMesh::from_mesh() body.

FemVertex

struct FemVertex
std::uint32_t node
Vec3 point
bool has_position

One B-rep vertex: node is the mesh node there, a sentinel where the mesh has none, which is ordinary rather than a fault — the analysis rebuilds a vertex wherever two trims meet, so a sphere has 48 of them where the mesh has two points, and a caller walking these skips the sentinel instead of reading it as a gap.

point is where the topology says the vertex is, in the same space and under the same placement as FemMesh::nodes() — the file's own vertex rather than a mesh node, so the two can differ by the reader's rounding. Meaningless unless has_position: it is all zeros then, a point no geometry has and one a solver would read as a node at the origin.

FemMesh::open_edges()

Result<std::vector<std::array<std::uint32_t, 3>>> open_edges() const

Every crack, as (a, b, brep_edge): a directed mesh edge (a, b) with no (b, a), and the B-rep edge both nodes lie on where they share one.

Empty unless the body's topology is closed — for a B-rep body, whose mesh is otherwise not asked about at all. The census asks whether a body that ought to enclose a solid does, and an open one — a sheet, a bag of surfaces, a shell the file itself wrote open — makes no such claim to check: its rim is not a crack. So such a body reports FemMesh::watertight() false with this and FemMesh::folded_edges() both empty, and that trio of answers together is what says "not asked", not "nothing found".

A FemMesh::from_mesh() body is the exception, and the opposite case. A bare mesh carries no topology to say whether it ought to close, so its census always runs over the welded triangles: an open one lists its cracks here with FemMesh::watertight() false, a closed one reports FemMesh::watertight() true with no topology consulted at all, and an empty census there really does mean "nothing found".

FemMesh::folded_edges()

Result<std::vector<std::array<std::uint32_t, 3>>> folded_edges() const

Every fold, as FemMesh::open_edges() reports a crack: a directed mesh edge used by more than one triangle, once.

A body can be folded without being open — a solid no thicker than a line leaves no hole for an open edge to find — and the closure census's own known-bad bodies are folds rather than open cracks. A caller that checks FemMesh::open_edges() alone calls such a body sound. Empty under the same rule as FemMesh::open_edges().

FemMesh::crossings()

Result<std::vector<std::array<std::uint32_t, 2>>> crossings() const

Every pair of triangles that pass through each other, as (a, b) with a < b, sorted: an edge of one through the other's interior. Their B-rep faces are FemMesh::triangle_face() at a and b.

Computed for every body, open or closed. FemMesh::watertight(), FemMesh::open_edges() and FemMesh::folded_edges() are topological and cannot see a surface passing through itself; a mesh is ready for a volume mesher when it is FemMesh::watertight() and this is empty — Gmsh refuses one that crosses. A copy.

FemMesh::watertight()

bool watertight() const

The welded mesh closes — every directed mesh edge paired with its reverse and none used twice — and, for a B-rep body, so does the topology behind it. false for every B-rep body whose topology is not closed, whose mesh is then not asked about; read FemMesh::open_edges() for what an empty census beside a false here does and does not mean.

A FemMesh::from_mesh() body has no topology to ask of, so this says only that its triangles close: a closed render mesh reports true with nothing exact behind it at all.

Ready for a volume mesher means this and an empty FemMesh::crossings(): this census is topological and cannot see a surface passing through itself.

FemMesh::from_mesh()

bool from_mesh() const

This came from the scene's own mesh rather than from a B-rep: one face, every node on face 0, no edges and no vertices.

It is also which space the mesh is in. A B-rep body's FEM mesh is in the file's own units and axes, whatever Convention the scene was opened with, because it is taken off the B-rep — and a B-rep is in the file's own space for the reason Brep gives. A node with no B-rep falls back to the scene's mesh, which is converted, so that one comes back in the scene's convention, wound counter-clockwise about the outward normal even where the convention winds the other way.

And it is which contract the census is reporting under: read FemMesh::open_edges().

FemMesh::min_angle()

double min_angle() const

The smallest interior angle of any triangle, in degrees. There is always one: a body that meshed to no triangles is a refusal, not a mesh.

FemMesh::worst_triangle()

std::uint32_t worst_triangle() const

The triangle with that angle, as an index into FemMesh::triangles().

FemMesh::longest_edge()

double longest_edge() const

The longest triangle edge, placed. The figure to check against Node::fem_mesh()'s max_size, and the only one that says what the mesh actually is. max_size bounds the boundary segments and merely targets the interior: measured at 1.03 x max_size on a face whose parameters run unevenly, where a full-size boundary piece met a much shorter one left by halving. One small enough beside the body to reach the mesher's own piece and station ceilings is not honoured at all.

FemMesh::msh_text()

Result<std::string> msh_text() const

The mesh as Gmsh 4.1 ASCII .msh text: an entity per B-rep vertex, edge and face, a volume where the body closes, and a physical group naming each.

Gmsh reads the file as written — measured with Gmsh 4.15: node and triangle counts equal to this mesh's, and a physical group per entity. To fill a closed body with tetrahedra, give Gmsh a volume of its own over the file's surfaces. In its Python API: gmsh.open(path), then faces = [t for _, t in gmsh.model.getBoundary([(3, 1)], oriented=False)], gmsh.model.geo.addVolume([gmsh.model.geo.addSurfaceLoop(faces)]), gmsh.model.geo.synchronize() and gmsh.model.mesh.generate(3). A plain generate(3) leaves a volume read from any .msh file empty — Gmsh's own saved meshes too — and gmsh.model.mesh.createGeometry() re-meshes the surfaces rather than keeping these triangles.

Prefer Gmsh's HXT algorithm: gmsh.option.setNumber("Mesh.Algorithm3D", 10) before generate(3). On these surfaces the default left tetrahedra of exactly zero volume (four in a 100 mm bar), which no solver can use, and HXT's worst element came out far better on curved bodies (a minimum SICN of 0.1 to 0.3 where the default's was 0.001). Then name the tetrahedra before saving: HXT fills the new volume rather than the file's own, and gmsh.write keeps only elements in a physical group, so without this step every tetrahedron is dropped from the file without a word — filled = [t for _, t in gmsh.model.getEntities(3) if len(gmsh.model.mesh.getElementsByType(4, t)[0])], gmsh.model.removePhysicalGroups(gmsh.model.getPhysicalGroups(3)) and gmsh.model.addPhysicalGroup(3, filled, name="body"). The saved file also lists a few interior nodes no element uses — points Gmsh's refinement tried and gave up on — so a solver reading it should keep only the tetrahedra's own nodes: each unused one is an unconstrained unknown.

On this side of the ABI the library's text is borrowed — a slot on this handle, replaced by the next call on it and gone when the mesh is freed. The wrapper copies it out on the way, so what a caller holds is a string of its own. The kernel library's own msh_text is the other way round: an owned string, released by the wrapper (cadaclysm_blacksmith_string_free at the ABI), two asks giving two independent texts. A reader porting one side's reasoning onto the other leaks or double-frees.

No unlicensed notice is printed here. Node::fem_mesh() gave it once when the mesh was built, and this ABI deliberately does not repeat it on either .msh call — where the kernel library notices on both of its writers and not on its builder. Each matches its own siblings, so moving the call to look like the other side breaks a convention.

It returns an Error in its Result for a mesh the writer refuses, naming the field it cannot honour, and for a freed handle.

A freed handle traps here rather than returning an Error. This call, save_msh and every array accessor check the handle first, and on a freed one that check reaches CADACLYSM_BAD_ACCESS (FemMesh::msh_text: the FEM mesh is freed) and does not return — in both modes, not only under CADACLYSM_CHECKED, because what it guards is a pointer about to be handed to C rather than a borrowed view's owner. Measured. So the Result above carries the writer's refusal and nothing else; a freed handle is a bug in the caller, as it is for Meshlets.

FemMesh::save_msh()

Result<void> save_msh(const std::string& path) const

FemMesh::msh_text() written to a path by the library itself: the same bytes from the same writer, straight to the file rather than through the borrowed slot, so a text asked of this handle on another thread cannot be freed under the write. It returns an Error in its Result for a mesh the writer refuses or a file it cannot write, naming the path. No notice here either; see FemMesh::msh_text().

FemMesh::free()

void free() noexcept

Give the mesh back, and with it every view taken from it. Idempotent; the collector or the scope does it otherwise.

FemMesh::freed()

bool freed() const noexcept

Whether FemMesh::free() has run.

Surfaces and Face

class Surfaces

A node's faces as exact surfaces and trims: what Node::surfaces() returns. Iterate it for Face values. In the file's own frame; Scene::surface_matrix() brings it into the scene's.

Surfaces::faces()

const std::vector<Face>& faces() const

The faces, one per trimmed face of the body.

Face

struct Face
std::uint32_t kind
std::array<float, 3> origin
std::array<float, 4> domain
std::array<float, 4> scalars
std::vector<Span<const float>> loops
Span<const float> nurbs

One trimmed face. kind is the surface: 0 plane, 1 cylinder, 2 cone, 3 sphere, 4 torus, 5 revolution, 6 extrusion, 7 NURBS, 8 sum. origin, ax, ay, az are its frame, scalars its kind-dependent sizes (radius, angle…) and domain its (u min, v min, u max, v max). loops holds the trim loops as (u, v) points, each closing implicitly; profile, profile2 and nurbs carry what a swept or NURBS surface needs. reversed flips the normal; transposed swaps u and v. The C header's CadaclysmFace is the full description.

Tolerances

struct Tolerances

What a file declares about its own precision, as a named tuple: absolute, a length in the file's own unit, and angular, in radians — each none where the file said nothing. What Scene::tolerances() returns.

Bounds

struct Bounds

An axis-aligned box: what Node::bounds() and Scene::bounds() return. All zeros means "nothing here".

Bounds::min

std::array<float, 3> min

The low corner.

Bounds::max

std::array<float, 3> max

The high corner.

Bounds::is_empty()

bool is_empty() const noexcept

Whether this is the all-zero box that stands for nothing.

Bounds::size()

std::array<float, 3> size() const noexcept

The extent along each axis.

Bounds::centre()

std::array<float, 3> centre() const noexcept

The midpoint.

Attribute

struct Attribute

One thing the file said about a node: what Node::attributes() lists.

Attribute::name

std::string name

What the file called it.

Attribute::kind

ValueKind kind

Which kind of value it holds — a ValueKind. Lets a caller tell a reference from prose, or total the numbers.

Attribute::value

std::variant<std::monostate, std::string, std::int64_t, double, bool> value

The value, in the language's own type where it has one for the kind.

A std::variant: std::monostate for none, std::string for text (lists and references too), std::int64_t, double or bool; read it with std::get_if.

Attribute::text()

std::string text() const

The value rendered for display, identically in every wrapper: true/false, reals in their shortest exact form, lists as [a, b, c].

Convention

enum class Convention : std::uint32_t

The coordinate space to open a file into. The library converts on the way out, so a caller names the space it draws in and reads geometry already in it — nothing to rotate or scale afterwards.

Convention

enum class Convention : std::uint32_t
native
unreal
unity
y_up
blender

The presets: NATIVE keeps the file's own axes and units; UNREAL is Z up, left-handed, centimetres; UNITY Y up, left-handed, metres; Y_UP Y up, right-handed, metres (glTF, three.js, most real-time engines); BLENDER Z up, right-handed, metres.

cadaclysm::FILE_UNITS

inline constexpr std::uint32_t FILE_UNITS = 0x100

Combine with a preset to keep its axes but the file's own units.

cadaclysm::UV_WORLD

inline constexpr std::uint32_t UV_WORLD = 0x200

Combine with a preset to ask for world-scale texture coordinates in Mesh::uvs(). Off by default: eight bytes a vertex nobody asked for.

cadaclysm::parse_convention()

Result<std::uint32_t> parse_convention(std::string_view text)

A convention from a name a user typed: unreal, or unreal+file-units. An unknown name returns an Error in its Result listing the accepted ones, rather than silently reading as native.

ValueKind

enum class ValueKind : std::uint32_t

Which kind of value an Attribute holds.

ValueKind

enum class ValueKind : std::uint32_t
none
text
integer
real
boolean
list
reference

TEXT, INTEGER, REAL, BOOLEAN; LIST (the elements rendered as [a, b, c]); REFERENCE (another entity, by the id the file gave it, so it can be followed rather than shown as prose); NONE for an attribute that had no value.

Manifold

struct Manifold

Whether a body's faces make a manifold — every edge bordered by one face or two, the faces round every vertex one fan — told from its topology rather than a mesh: what a brep's manifold and the kernel's Solid::manifold() return. Orientation is not asked. The topology is the file's: faces that name no shared edge (IGES, each surface its own sheet; an IFC face written as one polygon) read as open however well they meet in space.

Manifold::faces

std::uint32_t faces

How many faces.

Manifold::edges

std::uint32_t edges

How many distinct edges: one shared by two faces counts once.

Manifold::vertices

std::uint32_t vertices

How many distinct vertices.

Manifold::boundary_edges

std::uint32_t boundary_edges

Edges only one face borders: a sheet's rim, a hole in a shell.

Manifold::non_manifold_edges

std::uint32_t non_manifold_edges

Edges three or more faces border: a fin, or two solids meeting along a line.

Manifold::non_manifold_vertices

std::uint32_t non_manifold_vertices

Vertices whose faces make more than one fan: two solids touching at a corner.

Manifold::is_manifold

bool is_manifold

No non-manifold edge or vertex: a manifold, possibly with a boundary.

Manifold::is_closed

bool is_closed

A manifold with no boundary edge either: it encloses a solid.

SewReport

struct SewReport

What Brep::sew() did, as plain data: the edges it joined, the free edges before and after, how many groups of free edges it left free, the widest gap it sewed, and the two tolerances it used.

SewReport::pairs

std::uint32_t pairs

How many pairs of free edges it joined into one shared edge.

SewReport::free_before

std::uint32_t free_before

Free edges (those only one face borders) before sewing.

SewReport::free_after

std::uint32_t free_after

Free edges after sewing.

SewReport::refused

std::uint32_t refused

How many groups of free edges between the same two vertices it left free: too far apart for the tolerance, or more than two.

SewReport::worst_gap

double worst_gap

The widest gap between two curves it sewed.

SewReport::tolerance

double tolerance

How close two curves had to lie, as used: by default vertex.

SewReport::vertex

double vertex

How close two edges' ends had to coincide, as used: by default the rounding Brep::manifold() merges vertices at.

HealthReport

struct HealthReport

What is wrong with a body, as plain data: what Brep::health() returns. Nothing in it moves the body. It lists the free edges (the sides only one face bounds) and the wires they chain into, the features below the tolerance, the loose edges, what sewing would join and leave, and, if asked for, where the body's mesh cracks. The tolerance is an absolute length, as Rhino's model tolerance is; it is reported back as used.

HealthReport::tolerance

double tolerance

The length below which a feature is small and a gap closes, as used: by default 1e-4 times the body's diagonal. A value that is not finite and positive (NaN, infinite, zero or negative) takes the default.

HealthReport::rounding

double rounding

The rounding the body's vertices are merged at, as used.

HealthReport::extent

double extent

The body's diagonal, the length the default tolerance is a fraction of.

HealthReport::free_edges

std::vector<FreeEdge> free_edges

The free edges, as FreeEdge rows, each wire's edges together and in order.

HealthReport::wires

std::vector<FreeWire> wires

The chains the free edges make end to end, as FreeWire rows.

HealthReport::small

std::vector<SmallFeature> small

The features below the tolerance, as SmallFeature rows.

HealthReport::loose_edges

std::uint32_t loose_edges

How many shared edges are loose: the two faces' sides along the edge lie further apart than the larger of the tolerance the body recorded for the edge and the one given.

HealthReport::worst_loose

double worst_loose

The widest such gap; 0 when no edge is loose.

HealthReport::sew_pairs

std::uint32_t sew_pairs

How many pairs of free edges Brep::sew() (or Solid::join_sheets()) would join: those with shared_ends 2.

HealthReport::sew_refused

std::uint32_t sew_refused

How many groups of free edges it would leave free.

HealthReport::sew_worst_gap

double sew_worst_gap

The widest gap it would sew.

HealthReport::cracks

std::optional<Cracks> cracks

Where the body's mesh cracks, as a Cracks; std::nullopt unless the call asked for the mesh. Cracks are only counted on a closed body: for an open one the census is empty by design, so watertight false beside no edges means "not asked", not "nothing found".

HealthReport::worst_gap

double worst_gap

The widest gap between a free edge and its partner. A rim has no true partner, so it reads as a gap the size of the part.

HealthReport::wire_edges()

Result<std::vector<FreeEdge>> wire_edges(std::uint32_t wire) const

The free edges of one wire, by its number in wires, in order.

FreeEdge

struct FreeEdge

One free edge: a side only one face bounds, with its nearest partner. The partner is the nearest free edge other than a neighbour on its own wire, so the rim of a sheet reads as a gap the size of the part rather than as a crack, and a real seam reads as a small gap. The partner is a row index into free_edges.

FreeEdge::trim

std::uint32_t trim

The face's side this is.

FreeEdge::edge

std::optional<std::uint32_t> edge

The edge it lies on; std::nullopt for a side that has no edge.

FreeEdge::face

std::uint32_t face

The face it bounds.

FreeEdge::wire

std::uint32_t wire

The free wire it is on: a row of wires.

FreeEdge::partner

std::optional<std::uint32_t> partner

The nearest free edge across the gap, as an index into free_edges; std::nullopt if there is none.

FreeEdge::shared_ends

std::uint32_t shared_ends

How many of its two ends it shares with the partner: 2 is what Brep::sew() joins.

FreeEdge::length

double length

Its length.

FreeEdge::gap

double gap

The distance to the partner; infinite without one.

FreeWire

struct FreeWire

A chain of free edges end to end.

FreeWire::first

std::uint32_t first

The row of free_edges it starts at: its edges are the rows first to first + count.

FreeWire::count

std::uint32_t count

How many free edges it holds.

FreeWire::closed

bool closed

Whether it closes on itself.

FreeWire::length

double length

Its total length.

FreeWire::widest_gap

double widest_gap

The widest gap from any of its edges to a partner.

SmallFeature

struct SmallFeature

Something below the tolerance.

SmallFeature::kind

std::string kind

What it is: short_edge, collapsed_edge, sliver_face, tiny_face, tiny_body or small_hole (an inner loop whose edges are all free, below the tolerance in area or width: a pinhole in an open sheet; a hole with walls is not one).

SmallFeature::index

std::uint32_t index

Its edge, face or body number; a small hole's is its loop number.

SmallFeature::size

double size

How small it is.

Cracks

struct Cracks

What a mesh of the body shows, asked for with mesh=True: the call meshes the body. Only a closed body is counted: an open one's census is empty by design, as its rim is not a crack.

Cracks::watertight

bool watertight

Whether the mesh has no open or folded edge.

Cracks::open

std::uint32_t open

How many mesh edges only one triangle uses.

Cracks::folded

std::uint32_t folded

How many mesh edges more than two triangles use.

Cracks::crossings

std::uint32_t crossings

How many pairs of triangles pass through each other.

Cracks::edges

std::vector<std::uint32_t> edges

The body's edges the cracks lie along.

HealReport

struct HealReport

What Brep::heal() did, as plain data: the fixes it made, the small features it left and why, and the body's health before and after at the tolerance it healed at. Indices are the input body's.

HealReport::tolerance

double tolerance

The tolerance it healed at, as used: by default 1e-4 times the body's diagonal.

HealReport::moved

double moved

The furthest any trim the result keeps moved, measured: the edited trims against the originals. Not the same measure as a HealFix's moved, which is how far that fix's merged vertices moved: a curve can move further than its ends, and the trims of a dropped edge are not measured at all, so either can be the larger.

HealReport::guarded

bool guarded

Whether the guard refused a fix: the full result was worse (less closed, more free or non-manifold edges, or no faces left), so the face pass's fixes were refused and the rest kept, or, if that was still worse, every fix was refused and the body came back as it was. Refused fixes are listed as body_guard.

HealReport::fixes

std::vector<HealFix> fixes

What was done, as HealFix rows, in the order it was done. A short edge removed as part of a face is that face's fix and is not listed again.

HealReport::refused

std::vector<HealRefusal> refused

What health listed as small and was left, as HealRefusal rows.

HealReport::small_before

std::uint32_t small_before

How many small features health listed on the input.

HealReport::small_after

std::uint32_t small_after

How many it lists on the result.

HealReport::free_before

std::uint32_t free_before

The input's free edges (sides only one face bounds).

HealReport::free_after

std::uint32_t free_after

The result's free edges.

HealReport::closed_before

bool closed_before

Whether the input was closed.

HealReport::closed_after

bool closed_after

Whether the result is closed.

HealReport::nonmanifold_before

std::uint32_t nonmanifold_before

The input's edges three or more faces share.

HealReport::nonmanifold_after

std::uint32_t nonmanifold_after

The result's.

HealFix

struct HealFix

One small feature removed.

HealFix::kind

std::string kind

What it was, as SmallFeature's kind.

HealFix::index

std::uint32_t index

Its edge, face or loop number in the input, as health gave it.

HealFix::size

double size

How small it was.

HealFix::moved

double moved

How far the vertices this fix merged moved. The report's own moved is a second measure, how far any surviving trim moved, measured; either can be the larger.

HealRefusal

struct HealRefusal

One small feature left, and why.

HealRefusal::kind

std::string kind

What it is, as SmallFeature's kind.

HealRefusal::index

std::uint32_t index

Its edge, face or loop number in the input.

HealRefusal::why

std::string why

would_empty_loop (removing the edge would leave a loop with no trims: the face pass's case), closed (both ends already one vertex: a tiny closed curve), seam (one face uses the edge twice), chain (the vertices to merge span more than the tolerance), neighbours_part (a sliver's two long sides part by more than the tolerance), uneven (a sliver's long edges are not two, one per side), non_manifold (a sliver side three or more trims share), has_holes (the sliver or tiny face has inner loops), body_guard (the guard refused the fix), toggled (its kind switched off) or unsupported (a tiny body, which healing never removes).

HealRefusal::figure

double figure

The width of a chain, the gap of neighbours_part; 0 otherwise.

RecognizeReport

struct RecognizeReport

What Brep::recognize() did, as plain data: the faces and edges given an analytic kind, the faces left free-form and why, and the tolerance it fitted to. Faces and edges are numbered as in the body, before and after alike.

RecognizeReport::tolerance

double tolerance

The tolerance it fitted to, as used: by default 1e-6 of the body's extent.

RecognizeReport::faces

std::vector<RecognizedFace> faces

The faces given an analytic kind, as RecognizedFace rows.

RecognizeReport::refused

std::vector<RecognizeRefusal> refused

The free-form faces left, as RecognizeRefusal rows.

RecognizeReport::edges

std::vector<RecognizedEdge> edges

The edges whose curve was given an analytic kind, as RecognizedEdge rows, in edge order.

RecognizeReport::edges_left

std::uint32_t edges_left

How many edges were left on a free-form curve.

RecognizeReport::worst_face

double worst_face

The furthest any face taken lies from its analytic surface; 0 when none was taken.

RecognizeReport::worst_edge

double worst_edge

The furthest any edge taken lies from its analytic curve; 0 when none was taken.

RecognizedFace

struct RecognizedFace

One face given an analytic kind.

RecognizedFace::face

std::uint32_t face

Its face number, the same before and after.

RecognizedFace::kind

std::string kind

plane, cylinder, cone, sphere or torus.

RecognizedFace::deviation

double deviation

The furthest any sample of the face or point of its edges lies from the analytic surface.

RecognizeRefusal

struct RecognizeRefusal

One face left free-form, and why.

RecognizeRefusal::face

std::uint32_t face

Its face number.

RecognizeRefusal::why

std::string why

no_kind (no kind fits within the tolerance), mixed_normals (its normals point both ways), parameter_trims (a trim in its surface's parameters could not be lifted to space) or too_few_samples.

RecognizeRefusal::closest

std::optional<double> closest

For no_kind, the deviation of the kind that came closest; std::nullopt otherwise.

RecognizedEdge

struct RecognizedEdge

One edge whose curve was given an analytic kind.

RecognizedEdge::edge

std::uint32_t edge

Its brep edge id, as edge_tolerance takes one.

RecognizedEdge::kind

std::string kind

line, circle or ellipse.

RecognizedEdge::deviation

double deviation

The furthest any point of the curve or the edge lies from the analytic curve.

Errors

struct Error

A call into the library failed; the message is the library's own reason. One type for every reader failure.

Result and Error C++ only

class [[nodiscard]] Result
bool ok() const noexcept
const Error& error() const
T& value() &
const T& value() const&
T value_or(U&& fallback) const&
Result<std::invoke_result_t<F, const T&>> map(F&& f) const&
std::invoke_result_t<F, const T&> and_then(F&& f) const&
struct Error
std::string message
Origin origin
enum class Origin

Every call that can fail returns a Result<T> (result.hpp): a value or an Error, the library's own message and which library said it. Nothing throws, and the headers build with exceptions off. Test it (if (!r)), then *r or r->; CADACLYSM_TRY(var, expr) declares var or returns the error from the enclosing function, and CADACLYSM_TRY_VOID(expr) does the same for a Result<void>. map and and_then chain without the macro. Error.origin says which library answered: Origin::reader, Origin::kernel, or Origin::view for every call of cadaclysm/view.hpp — the view library's own message, or the wrapper's refusal.

A misuse — value() on an error, a read through a stale view, a call on a closed or moved-from owner — calls CADACLYSM_BAD_ACCESS(message), which prints and aborts unless it is defined before the first include; it must not return, and a longjmp out of it is only safe from the plain view, node and placement accessors. The stale-view checks are checked mode's: on unless NDEBUG, or set CADACLYSM_CHECKED to 0 or 1. Every translation unit must agree on both, and on C++17 or C++20 (a Span or a std::span).

Kernel · cadaclysm_blacksmith_*

Building solids

Frames and axes

A frame is twelve numbers: an origin, then the x, y and z axes, each three numbers (0,0,0, 1,0,0, 0,1,0, 0,0,1 is the world). A profile is drawn in its frame's x/y and extruded along its z. An axis is six numbers: a point and a direction, which need not be unit. Workplane::xy() and friends start on the three world planes; Solid::face_frame() gives the frame on a face. A Frame builds one for you — Frame::xy() at any origin, Frame::at() from a point and a normal — and checks that its axes are square and right-handed, which a bare twelve numbers are not.

Frames are const Frame&, always checked: Frame::xy, Frame::at, Frame::make and Frame::of build them. An axis is an AxisLine, {{px, py, pz}, {dx, dy, dz}}.

Module functions

The kernel's own module: its version, licence, STEP and .brep writers. The kernel and the reader are one library, so its licence call and the reader's set the same licence.

cadaclysm::blacksmith::write_step()

Result<void> write_step(const std::string& path, const Solids& solids, const std::optional<std::string>& schema = std::nullopt, Unit unit = Unit::millimetre)

Write several solids as one STEP file, each its own body. unit is mm, m or in. schema is left out for AP203 (built in — no file needed; AP242 when any solid, face or edge is coloured, since AP203 has no colour entities), the name of another built-in schema such as AP242's AP242_MANAGED_MODEL_BASED_3D_ENGINEERING_MIM_LF (AP214's AUTOMOTIVE_DESIGN cannot carry the writer's mechanical_context), or a custom EXPRESS schema: a path to its .exp or its text. Colours from coloured and edges_coloured are written as STEP styling wherever the schema has it, a solid's read back as the node's colour; a named schema without it writes the solids bare.

cadaclysm::blacksmith::write_step_text()

Result<std::string> write_step_text(const Solids& solids, const std::optional<std::string>& schema = std::nullopt, Unit unit = Unit::millimetre)

The same STEP file as text, for a caller that stores or sends it rather than writing a file.

write_step_assembly

Write an assembly as one STEP file: parts names each solid, in its own coordinates, and each is written once as its own product; placements lists (name, frame) pairs, each an occurrence of that part at that frame (right-handed and orthonormal), all under one root product. A reader tessellates a part once however many times it is placed, and shows each placement under its part's name. schema and unit as cadaclysm::blacksmith::write_step().

Not in this wrapper: build an Assembly and write it with step or step_text.

write_step_assembly_text

The same assembly as STEP text.

Not in this wrapper: build an Assembly and write it with step or step_text.

cadaclysm::blacksmith::write_brep()

Result<void> write_brep(const std::string& path, const Solids& solids)

Write several solids as one OCCT .brep file, each its own solid under one compound (a single solid is the file's root): the exact surfaces and curves, with a curve in each face's own parameters for every edge, so Open CASCADE's BRepTools::Read gives a shape its BRepCheck_Analyzer finds valid. No unit is declared — a .brep carries none — so the numbers written are the numbers held. The library writes the file itself.

cadaclysm::blacksmith::write_brep_text()

Result<std::string> write_brep_text(const Solids& solids)

The same .brep file as text.

cadaclysm::blacksmith::write_sat()

Result<void> write_sat(const std::string& path, const Solids& solids, Unit unit)

Write several solids as one ACIS SAT file, each its own body: planes, cylinders, cones, spheres and tori as their own records, splines and swept surfaces as exact NURBS, in the layout Rhino's own exporter writes. unit is mm, m or in and goes into the header as millimetres per unit. The library writes the file itself, so a refusal names it.

cadaclysm::blacksmith::write_sat_text()

Result<std::string> write_sat_text(const Solids& solids, Unit unit)

The same SAT file as text.

cadaclysm::blacksmith::write_3dm()

Result<void> write_3dm(const std::string& path, const Solids& solids, Unit unit)

Write several solids as one Rhino .3dm (version 8, which Rhino 8 and 9 open), one object each: its exact brep — the surfaces and trims as they are — or, where a body has no exact form there, its mesh, with a warning saying so. Each object is named as its solid is and coloured with the solid's own colour, each painted face with its own (Rhino keeps it on the face; a body written as its mesh carries them as vertex colours; an edge's own colour has no place in a .3dm and is left out, with a warning saying so), and carries the solid's attributes as user text. unit is mm, m or in and is the file's unit: the numbers written are the numbers held. The library writes the file itself, so a refusal names it.

cadaclysm::blacksmith::rhino3dm_bytes()

Result<std::vector<std::uint8_t>> rhino3dm_bytes(const Solids& solids, Unit unit)

The same .3dm file as bytes.

cadaclysm::blacksmith::mesh_file()

Result<std::vector<std::uint8_t>> mesh_file(const Solids& solids, const std::string& format = "stl", const std::optional<std::vector<std::string>>& names = std::nullopt, const std::optional<std::vector<std::array<double, 6>>>& looks = std::nullopt, std::optional<double> tolerance = std::nullopt)

Several solids meshed at tolerance — each the mesh Solid::mesh() hands out — as one file's bytes in format: "stl" (binary, every solid in one body), "stl-ascii" (one body named as the first solid), "obj" (one named object a solid, no material library), "glb" or "gltf" (one named node a solid in a material of its own; the .gltf with its buffer embedded), "3mf" (a 3MF package, one named object a solid, in millimetres), "ply" (binary little-endian) or "ply-ascii" (PLY, every solid's triangles in one body). 3MF and PLY carry the solids' colours — each face its own where it was painted, else the solid's; 3MF a colour a triangle, PLY a colour a vertex — and none when no solid is coloured. names one a solid (left out: each solid's own name, else Solid 1, Solid 2, ...); looks one a solid, six numbers each — linear r, g, b, a, metallic, roughness in 0..1 — the glTF's materials (left out: each solid's own colour); the other formats ignore them. No solids, an unknown format, or names or looks not one a solid returns an Error in its Result.

cadaclysm::blacksmith::write_svg()

Result<void> write_svg(const std::string& path, const Solids& solids, const SvgOptions& options)
Result<void> write_svg(const std::string& path, const Solids& solids, const Profiles& profiles, const SvgOptions& options)

Several solids and profiles' wireframe as one SVG, any mix and any order: a <g id="solid-<i>"> per solid then a <g id="profile-<i>"> per profile, each stroked in its own colour where it carries one — a solid's edge colour first, then its body colour (a face colour says nothing about a wireframe) — and the keywords' stroke= otherwise. The keywords are Scene::svg()'s own: view= (front, back, left, right, top, bottom, iso), az=/el= over it, up= (default z: neither a solid nor a profile carries a convention of its own to default it from), fov= (0, the default, is orthographic), size=, margin=, tolerance=, stroke= and background= ("#rgb", "#rrggbb" or a CSS colour name in every language, beside that language's own numeric form; background= std::nullopt for transparent), width= (the stroke's, in page units), edges=, curves=, isocurves=, polylines= (which line sets are drawn; edges by default), and silhouettes= (also draw where each solid's surfaces turn away from the eye — the outline a sphere has no edge for, on by default: a sphere's and a torus's only curves are the seams where their one face meets itself, which are not edges of the body and are never drawn, so without it those two draw a blank page. A line set in its own right, so silhouettes= with edges= off draws the outline alone).

hidden= draws the solids through hidden-line removal, the solids on the page hiding one another, seen from the eye the other words describe: std::nullopt (the default) draws every line, "removed" only what is seen — edges in solid-<i>, outlines in solid-<i>-silhouettes — and "dashed" adds the hidden lines, dashed, in a solid-<i>-hidden group. Profiles neither hide nor are hidden.

A list of solids alone draws exactly as it always did. The SVG is the drawing itself: with path, writes it to the file and returns std::nullopt; without, returns the SVG text. Both lists empty returns an Error in its Result; so does anything in them that is neither a solid nor a profile, a refused option, or a failed write.

Hlr::of()

static Result<Hlr> of(const Solids& solids, const HlrOptions& options = HlrOptions())

Hidden-line removal of several solids, each where it stands, every solid hiding the others: what a drawing of them shows, and what it shows only dashed, as an Hlr. A parallel view along direction (from the eye toward the model; default (0, 1, 0), the front) with up the page's up (default (0, 0, 1)), or, with eye, a perspective from eye toward target — not both direction and eye. Each line is a span of an edge's own curve or of a silhouette, exact as rational cubic Béziers; iso above 0 adds that many isocurves each way on every face; smooth_angle (radians, default one degree) is how near tangent two faces are for the edge between them to be "smooth". tolerance std::nullopt or 0 is the solids' effective tolerance. View coordinates are the camera's, x right and y up, the origin on the sight line through the solids' box centre. No solids, a zero direction or up, up along the sight line, eye on target, or an angle or tolerance out of range returns an Error in its Result.

Hlr::of_meshes()

static Result<Hlr> of_meshes(const std::vector<std::reference_wrapper<const TriangleMesh>>& meshes, const HlrOptions& options = HlrOptions())

Hlr::of() of triangle meshes (TriangleMesh), each a solid of flat triangles: its lines are the edges whose two triangles turn by more than feature_angle (radians, default thirty degrees), the edges with one triangle, and the edges between a triangle facing the eye and one facing away (the outlines); the triangles hide exactly. Each line's source is a mesh edge, its two vertices. The same view words as Hlr::of(), bar iso and smooth_angle.

cadaclysm::blacksmith::projected_outline()

Result<std::vector<Profile>> projected_outline(const Solids& solids, const HlrOptions& options = HlrOptions())

The boundary of the union of the solids' projections, as closed Profiles in Hlr::of()'s view coordinates: each outer loop counter-clockwise with its holes clockwise inside it, so a through hole seen along its axis is a hole. The silhouette a part casts — what a laser cuts or a pocket clears — ready to extrude. Hlr::of()'s view words, bar iso and smooth_angle.

cadaclysm::blacksmith::dxf_profiles()

Result<std::vector<Profile>> dxf_profiles(const std::string& text, std::optional<double> tolerance = std::nullopt)

A DXF file's closed loops as Profiles, the way back from a drawing: its lines, arcs, circles, ellipses, polylines and splines (blocks inserted) chained end to end within tolerance (std::nullopt or 0: the effective tolerance over the drawing's extents) into closed loops, each hole nested in the loop around it. Text that is not DXF returns an Error in its Result, naming the line it stopped at.

HLR_KINDS

The kinds of a hidden-line view's lines, in the C API's numbering from 0: "sharp" (an edge between faces that meet at an angle), "smooth" (an edge between faces near tangent), "outline" (a silhouette, where a surface turns away from the eye), "iso" (an isocurve) and "boundary" (an edge with one face, a sheet's rim).

HlrLine::kind is the kind's name as a std::string: "sharp", "smooth", "outline", "iso" or "boundary".

SquishDeformation

enum class SquishDeformation : std::uint32_t

The deformations Solid::squish() takes, by name, and their C API codes: free 0, stretch_mostly 1, stretch_only 2, compress_mostly 3 and compress_only 4.

PageUnits

enum class PageUnits : std::uint32_t

The units a Page can be drawn in, by name, and the DXF $INSUNITS code each is written as: unitless 0, in 1, ft 2, mm 4, cm 5 and m 6.

cadaclysm::blacksmith::default_schema()

Result<std::string> default_schema()

Where an ap203.exp file is found (CADACLYSM_SCHEMAS, else schemas/ in a parent). No longer needed to write STEP: the kernel's AP203 is built in.

cadaclysm::blacksmith::version()

std::string version()

The version of the kernel library actually loaded.

cadaclysm::blacksmith::flavour()

std::string flavour()

Which library the kernel loaded: "full", "kernel-reader" or "kernel" for a flavour of the single cadaclysm library, and "kernel" for the separate cadaclysm_blacksmith of earlier releases. Loading the kernel from the reader flavour returns an Error in its Result at once, naming the flavours that have a kernel; a call the loaded flavour does not have (a writer or a part on "kernel") returns an Error in its Result when it is made.

cadaclysm::blacksmith::features()

std::string features()

The features the kernel's library was built with, comma-separated, as the reader's query answers them; empty for the separate cadaclysm_blacksmith.

cadaclysm::blacksmith::build_date()

std::string build_date()

When the loaded kernel was built, YYYY-MM-DD.

cadaclysm::blacksmith::build()

std::string build()

The loaded kernel's build: its version, the commit and branch it was built from ("unknown" built from no checkout), when (a release's pinned date), and its build date — {"branch": "master", "commit": "7e4b5058e", "date": "2026-11-14", "time": "2026-11-14T10:22:31Z", "version": "0.14.2"}. What an app shows as the cadaclysm it runs on. Python returns it as a dict and JavaScript as an object; the other languages return the JSON text.

cadaclysm::blacksmith::pair_freedom_count()

std::uint32_t pair_freedom_count(std::string_view kind)

How many freedoms a pair kind has, so a caller can size Assembly::pair()'s ranges. 0 for an unknown name, and for fully_constrained, which has none.

cadaclysm::blacksmith::license()

Result<void> license(const std::string& text_or_path)

Load a licence into the kernel — the text, or a file's path. The reader has its own call; the same file works for both.

cadaclysm::blacksmith::license_info()

std::string license_info()

One line about the kernel's licence, or unlicensed. Never std::nullopt.

cadaclysm::blacksmith::license_notice_count()

std::uint64_t license_notice_count()

How many unlicensed notices the kernel has printed to stderr in this process.

cadaclysm::blacksmith::set_option()

Result<void> set_option(const std::string& name, double value)

Set a kernel option, by its name, for the whole process from the next call on — every thread, every solid. The options are numbers under stable names, one call for all of them, so an option added later needs no new function:

boolean.mesh_budget (default 500000): the most triangles a boolean (join, cut, common, split) builds its trees from, its two solids' meshes together. Past it the boolean refuses with a tolerance error rather than running for minutes or hours. A whole number, at least 1, or infinity for no limit.

boolean.finest_tolerance (default 1e-8): the finest tolerance a boolean takes, as a share of how far its two solids reach; under it the boolean refuses before meshing anything. From 0 (no floor) to below 1.

profile_boolean.point_budget (default 8000000): the most points a profile boolean follows its two profiles' arcs and splines with. Past it the boolean refuses with a tolerance error; 8 million is about 128 MB. A whole number, at least 1, or infinity for no limit.

measure.default_accuracy (default 1e-7): the relative accuracy Solid::mass(), Solid::edge_length(), Profile::length() and the arc-length samples (Solid::edge_point_at_length(), Profile::point_at_length() and their divides) refine to when they are asked for 0, the default. Above 0 and below 1. Solid::oriented_box() has its own default, 1e-5, and does not read it.

step.validation_properties (default 0): whether a STEP part file (Solid::step(), cadaclysm::blacksmith::write_step()) carries each body's geometric validation properties — the surface area, the volume and the centroid this kernel measures for it, stated in the file so the kernel that reads it can check the transfer against its own measurement of the same geometry. 1 to write them, 0 not to. Off by default because it measures every body in the file at step.validation_accuracy. With no schema named the file moves to AP242, as a colour moves it, since AP203's first edition has no entity to state a property with; a named schema that cannot state them returns an Error in its Result rather than writing the file without the figures. A body whose measurement is refused is written without properties, and the file is still written. An assembly file (write_step_assembly) never carries them. A reader finds them again on the node, under Node::attributes().

step.validation_accuracy (default 1e-5): the relative accuracy each body is measured to for those figures — 1e-5, as Solid::oriented_box()'s own default, not measure.default_accuracy's 1e-7, because 1e-7 costs tens of seconds on a free-form body and a file is a whole model of them. Above 0 and below 1. STEP has no field for an error bound, so the figures written are as good as this and no better: a receiver who wants to compare against a finer figure asks for a finer one here.

tolerance.relative (default 1e-4): the share of a solid's size a verb given no tolerance (0, or none where the language has it) works at, unless the solids declare a looser absolute tolerance — see cadaclysm::blacksmith::effective_tolerance(). Above 0 and below 1.

tolerance.angular (default one degree, in radians): the angle that stands in where nothing declares one. Above 0 and below a right angle.

intersect.free_form_exact (default 0): whether Solid::intersect()'s exact route takes free-form faces too — NURBS, extrusion, revolution and sum faces, each held as its exact NURBS — rather than only planes, cylinders, cones, spheres, tori and certified helical walls. Where it answers, every chain lies on its exact curve, certified to have missed no branch. 1 to take them, 0 not to. Off by default because an exact answer on a free-form body costs several times the mesh route's (a median 3.9 s against 0.7 s on corpus bodies against their turned copies), and where the exact route refuses — a near-tangent pair it cannot certify, a face with no exact NURBS form — the mesh route still runs after it. There is no work budget. The booleans and the section verbs never read it.

A name that is not an option, or a value the option does not take, returns an Error in its Result and changes nothing, saying which and what it takes.

cadaclysm::blacksmith::option()

Result<double> option(const std::string& name)

A kernel option's value, by its name: what cadaclysm::blacksmith::set_option() last set, else its default (see cadaclysm::blacksmith::set_option() for the names). A name that is not an option returns an Error in its Result, listing the ones there are.

cadaclysm::blacksmith::brep_layout_id()

std::string brep_layout_id()

How the loaded kernel lays a brep out in memory: its compiler, target and source. Solid::from_node() works only where this equals the reader's Brep::layout_id() — both modules on the same release of the library.

library_path

Where the kernel library was found: CADACLYSM_BLACKSMITH_LIBRARY first, then as the reader's.

Linked at build time: the OS loader finds the libraries; see Install.

cadaclysm::blacksmith::thread_sizes()

Result<std::vector<ThreadSize>> thread_sizes()

The whole thread size table as ThreadSizes: ISO metric coarse M1 .. M64, ISO metric fine M8x1 .. M64x4, UNC #1 .. 1-1/2", UNF #0 .. 1-1/2", in that order, each by ascending major.

cadaclysm::blacksmith::thread_size()

Result<ThreadSize> thread_size(std::string_view designation)

The ThreadSize designation names: the exact designation first, then forgiven — case and spaces ignored, "M10" the coarse row, "M10x1.25" the fine one, "1/4-20" the UNC or UNF row of that TPI. A designation no row matches returns an Error in its Result.

cadaclysm::blacksmith::gear_centre_distance_involute()

Result<double> gear_centre_distance_involute(double module, std::uint32_t teeth_first, std::uint32_t teeth_second, std::optional<double> shift_first = std::nullopt, std::optional<double> shift_second = std::nullopt, std::optional<double> pressure_angle = std::nullopt)

The centre distance of two involute gears of module, teeth_first and teeth_second teeth, in mesh without backlash: module (z1 + z2) / 2 cos(alpha) / cos(alpha_w), the working angle alpha_w solved from the shifts. std::nullopt is the default: shifts 0, pressure_angle 20 degrees (radians). A module not positive, fewer than 4 teeth, a pressure angle outside (0, pi/4) or shifts that leave no working angle returns an Error in its Result.

cadaclysm::blacksmith::contact_settle()

Result<Settle> contact_settle(const Profile& driver, const Vec2& driver_pivot, double driver_angle, const Profile& follower, const Vec2& follower_pivot, double previous, std::int32_t direction, std::optional<double> limit = std::nullopt, std::optional<double> tolerance = std::nullopt)

Where the follower comes to rest, as a Settle: two profiles turning about parallel axes, the driver held at driver_angle, the follower urged along direction (+1 counter-clockwise, -1 clockwise) from previous — an escapement's pallet and wheel, a ratchet and its click. Each profile is drawn in its own frame, the frame's origin at its pivot: a local point p of a link at angle a lies at pivot + R(a) p; angles are radians. Both profiles are regions with their holes. A follower that starts penetrating recoils against direction to first contact; otherwise it advances to first contact or to limit, an absolute follower angle. Conservative advancement on the exact profiles (lines and arcs in closed form, other segments through their NURBS form) never steps over a thin feature, and the answer never penetrates: in contact the gap is within tolerance. std::nullopt is the default: limit one full turn from previous along direction, tolerance 1e-9 times the larger bounding-box diagonal of the two placed profiles. A profile with no segments, a pivot, angle or previous not finite, a direction other than +1 or -1, a limit infinite or not strictly along direction from previous, a negative or infinite tolerance, a follower that cannot clear by turning, or no convergence within 100 000 gap evaluations returns an Error in its Result.

cadaclysm::blacksmith::angle()

Result<double> angle(const Vec3& a, const Vec3& vertex, const Vec3& b)

The angle at vertex between the arms to a and to b, in radians 0 to pi. A point not finite, or an arm of no length, returns an Error in its Result.

cadaclysm::blacksmith::effective_tolerance()

Result<double> effective_tolerance(const Solids& solids)

The tolerance a verb given none — 0, or none where the language has it — works at over solids: the larger of the loosest absolute tolerance they declare (Solid::tolerances()) and tolerance.relative (see cadaclysm::blacksmith::set_option()) times the largest of their sizes, never finer than their coordinates can represent. Every verb that takes a distance tolerance (booleans, fillets, shells, splits, sections, hits, meshes, curve fits, profile verbs) reads it so; the wrappers' own defaults (0.05 for a boolean) stay what they are. 0 for no solids, or solids with nothing to size by, which a verb refuses.

cadaclysm::blacksmith::boxes_apart()

Result<bool> boxes_apart(const Box& a, const Frame& frame_a, const Box& b, const Frame& frame_b)

True only if box a at frame_a and box b at frame_b cannot touch — a separating axis among the boxes' face normals and edge-direction crosses; touching is not apart. Sharper than moving each box (Box::move()) and asking Box::overlaps(), which boxes the *result* on the world axes again and so can call two oriented boxes overlapping when they are not (two unit boxes, the second turned 45 degrees about z and moved 2.3 along x: their world boxes overlap, but the boxes themselves do not touch). frame_a or frame_b not twelve finite numbers or not rigid returns an Error in its Result.

cadaclysm::blacksmith::clash()

Result<std::vector<Clash>> clash(const Solids& parts, const std::optional<Solids>& others = std::nullopt, double clearance = 0.0, std::optional<double> tolerance = DEFAULT_TOLERANCE, const std::vector<std::pair<std::uint32_t, std::uint32_t>>& allowed = {})

Every pair of parts — or, with others, every part of parts against every part of others — that penetrates, touches or lies within clearance of the other, as Clash rows, the solids as they stand. It is the question Solid::closest() and Collider::check() leave open: not how far apart two parts are, nor only whether they overlap, but which pairs are in trouble and how. A row's kind is decided in this order: "penetrating" where the volumes overlap; "touching" where the boundaries are within tolerance of each other; "too_close" where they are apart by more than tolerance but less than clearance; "refused" where the pair could not be decided. A pair further apart than clearance gives no row, and with clearance 0 there are no "too_close" rows. tolerance is the meshing tolerance, absolute, in model units (0.05 by default); a distance is exact to within it. In a row a indexes parts and b indexes others (or parts again, when there are no others; then a < b). Rows come in pair order. allowed is pairs of part indices never tested — designed contacts — each exactly two integers; with others a pair is (index in parts, index in others). A negative or non-finite clearance, a tolerance not positive and finite, an allowed pair that is not two indices or one out of range, an empty others, or a part that is not a closed solid returns an Error in its Result; the kernel's own words are prefixed clash:. For the same parts moved pose after pose, build a Collider and ask Collider::clash(). Whether the parts meet on the way from one pose to the next is cadaclysm::blacksmith::swept_clash()'s question.

cadaclysm::blacksmith::swept_clash()

Result<std::vector<SweptClash>> swept_clash(const Solids& parts, const Poses& poses, const std::optional<Solids>& others = std::nullopt, const std::optional<Poses>& other_poses = std::nullopt, double clearance = 0.0, std::optional<double> tolerance = DEFAULT_TOLERANCE, double resolution = 1e-3, std::uint32_t max_steps = 100000, const std::vector<std::pair<std::uint32_t, std::uint32_t>>& allowed = {})

Every pair of parts — or, with others, every part of parts against every part of others — that penetrates, touches or comes within clearance of the other anywhere on a path, as SweptClash rows: cadaclysm::blacksmith::clash()'s question asked of the motion, not only of the poses. Each part is its own group: pose k of poses is one Frame (or twelve numbers) per part of parts, and pose k of other_poses one per part of others; others and other_poses go together, and the two have as many poses. The motion between poses, the guarantee, resolution and max_steps are Collider::swept_clash()'s; clearance, tolerance (the meshing tolerance, absolute, 0.05 by default) and allowed are cadaclysm::blacksmith::clash()'s, and a row's a indexes parts, its b others (or parts again; then a < b). Rows come in pair order. others without other_poses or the other way round, a different number of poses in the two, a pose with the wrong number of frames, an empty set, fewer than two poses, an allowed pair that is not two indices or one out of range, a part that is not a closed solid, or a bad frame, tolerance, clearance, resolution or max_steps returns an Error in its Result; the kernel's own words are prefixed swept_clash:.

cadaclysm::blacksmith::thickness()

Result<std::vector<Thickness>> thickness(const Solids& solids, double maximum, double sharp_angle = 0.0, std::optional<double> tolerance = THICKNESS_TOLERANCE)

Every wall-thickness reading within maximum on solids, measured against each other, as Thickness rows by body then vertex: a ThicknessGauge built at tolerance (0.01 by default), asked ThicknessGauge::thickness() once and freed. Build the gauge yourself to ask more than once. maximum not positive and finite, sharp_angle negative or not finite, or a tolerance not positive and finite returns an Error in its Result, with the gauge call's own prefix (thickness_gauge_new:, thickness_gauge_measure:).

cadaclysm::blacksmith::mesh_thickness()

Result<std::vector<MeshThickness>> mesh_thickness(const std::vector<ThicknessInputMesh>& meshes, double maximum, double sharp_angle = 0.0)

The wall-thickness rule on plain meshes, measured against each other, as MeshThickness rows by mesh then vertex. Each of meshes is a pair: its points, (x, y, z) each, and its triangles, three indices into its own points each. From a vertex P the thickness is the distance to the nearest triangle that opposes one of P's own triangles (their normals more than 89 degrees apart) with P on or behind its plane — not a ray cast along the normal. A triangle with a vertex exactly at P is skipped; if one of those meets P's own at an interior angle under sharp_angle radians, P is a knife edge and reads 0. A vertex with no such triangle, or one further than maximum, gives no row: readings are dropped, not clamped. At the sharp rims of faceted holes it can read the wall far too thin (the distance to a neighbouring facet), an open finding. A mesh that is not such a pair, a position not finite, a triangle naming a point past its mesh, maximum not positive and finite, or sharp_angle negative or not finite returns an Error in its Result.

cadaclysm::blacksmith::closest_points()

Result<std::vector<std::vector<std::size_t>>> closest_points(const std::vector<Vec3>& hay, const std::vector<Vec3>& needles, double limit)

For each of needles, the indices of the hay points within limit of it, nearest first and equal distances by index — one RTree over hay answers every needle. A point within exactly limit counts. A limit negative or NaN, then the first hay point and the first needle with a NaN or infinite coordinate, by index, returns an Error in its Result.

cadaclysm::blacksmith::k_neighbors()

Result<std::vector<std::vector<std::size_t>>> k_neighbors(const std::vector<Vec3>& hay, const std::vector<Vec3>& needles, std::uint32_t k)

For each of needles, the indices of the k nearest hay points, nearest first and equal distances by index (the smaller indices win a tie at the k-th place); every hay point when k is over their count. The first hay point and the first needle with a NaN or infinite coordinate, by index, or a k above 1,000,000, returns an Error in its Result.

Tolerances C++ only

inline constexpr double DEFAULT_TOLERANCE = 0.05
inline constexpr double FILLET_TOLERANCE = 1e-6

The defaults behind every tolerance argument: DEFAULT_TOLERANCE (0.05) for booleans, meshes and bounds, FILLET_TOLERANCE (1e-6) for fillet, chamfer, refillet and shell — to pass one explicitly before a later argument.

Unit C++ only

enum class Unit : std::uint32_t
metre
millimetre
inch

The unit a STEP file is written in; millimetres by default.

rgb C++ only

Result<Vec3> rgb(std::string_view colour)

{r, g, b} in 0..1 from "#rgb", "#rrggbb" or a CSS colour name.

packed C++ only

Result<std::uint32_t> packed(std::string_view colour)

blacksmith::packed(std::string_view): a colour packed 0xRRGGBB from "#rgb", "#rrggbb" or a CSS colour name — for a host that wants the number itself; cadaclysm::blacksmith::write_svg()'s stroke/background take the text directly, as a cadaclysm::SvgColour.

Profile

class Profile

A closed outline with holes, in its own x/y — what gets extruded, revolved, lofted or swept. Immutable: every method returns a new one.

Its loops must be simple: an outline that crosses or touches itself (a figure-eight, a vertex landing on another side), a hole that runs into the boundary, or two holes that overlap are refused by every call that builds a face or a closed solid, naming the loops — extrude: hole 0 crosses the boundary. The open calls (extrude_open, revolve_open, sweep_open, loft_open) build sheets, and take such a profile as it is.

Profile::rect()

static Result<Profile> rect(double w, double h)

A w × h rectangle centred on the origin.

Profile::circle()

static Result<Profile> circle(double r)

A circle of radius r about the origin.

Profile::slot()

static Result<Profile> slot(const Vec2& centre, double length, double r)

A slot (stadium) length long overall, with end radius r, centred on centre and running along x. length must exceed 2 * r.

Profile::polygon()

static Result<Profile> polygon(const std::vector<Vec2>& points)

A closed polygon through the points, in order, its side back to the first point a segment of its own. At least three points.

Profile::regular_polygon()

static Result<Profile> regular_polygon(const Vec2& centre, double radius, std::uint32_t sides, double angle = 0.0)

A regular polygon of sides sides (at least 3) on the circle of radius about centre, its first corner at angle radians from the sketch's x axis (0 by default), the rest counter-clockwise. More than a million sides returns an Error in its Result.

Profile::circumscribed_polygon()

static Result<Profile> circumscribed_polygon(const Vec2& centre, double radius, std::uint32_t sides, double angle = 0.0)

A regular polygon of sides sides (at least 3) whose sides touch the circle of radius about centre — the polygon across flats, as a nut's hex is specified: its corners on the circle of radius / cos(pi / sides), each side's midpoint on the circle of radius. The first corner is at angle radians from the sketch's x axis (0 by default), the rest counter-clockwise, on the same rays as Profile::regular_polygon()'s corners for the same angle, so the inscribed and circumscribed polygons of one circle nest corner to corner. More than a million sides returns an Error in its Result.

Profile::star()

static Result<Profile> star(const Vec2& centre, double outer, double inner, std::uint32_t points, double angle = 0.0)

A star of points tips (at least 3) on the circle of outer about centre, its inner corners on the circle of inner (positive, under outer), alternating: the first tip at angle radians from the sketch's x axis (0 by default), the rest counter-clockwise, each inner corner half a step on from the tip before it. 2 * points straight sides; an inner not under outer, or more than a million points, returns an Error in its Result.

Profile::text()

static Result<std::vector<Profile>> text(const std::string& text, double size = 10.0, const std::string& font = "", const std::string& halign = "left", const std::string& valign = "baseline", double spacing = 1.0, const std::string& direction = "ltr", const std::optional<std::vector<std::uint8_t>>& font_bytes = std::nullopt)

text set in a font, one profile per closed shape — a letter with its counters as holes (o one, 8 two; i is two profiles) — on the sketch plane, the baseline along x from the origin, each outline counter-clockwise and its holes clockwise, a curved side the font's own cubic Bezier kept exactly: an extruded O has curved walls, and writes to STEP as splines. size (10 by default) is roughly the height of a capital. font is a family, optionally with a style ("Liberation Sans:style=Bold"), a font file's path, or empty for the bundled Liberation Sans Regular — which also serves when the family is not found, so text never comes back empty; font_bytes a font file's bytes, used instead of font when given (a page or a phone fetches its own font). halign is left (default), center or right; valign baseline (default), bottom, center or top; spacing (1 by default) multiplies the gap between glyphs; direction ltr (default) or rtl. Glyphs are laid out one after another by their advance widths — no shaping, so Latin sets as expected and scripts that need ligatures or reordering do not. Empty text is an empty list. A size or spacing not positive and finite, an alignment or direction not one of those words, or font bytes that are not a font returns an Error in its Result.

Profile::spline()

static Result<Profile> spline(const std::vector<Vec2>& points, std::uint32_t degree = 3, const std::optional<std::vector<double>>& weights = std::nullopt, bool closed = false)

A spline of degree (3 by default) through the control polygon points, weights one per point or std::nullopt. Open, it starts on the first point and ends on the last: an open chain, for Solid::extrude_open() or Profile::chain(). Closed, it is periodic — smooth through its own start, no corner there — and a closed profile. The degree is lowered to fit the points; a degree of zero, too few points (two open, three closed) or a weight not positive returns an Error in its Result.

Profile::path()

static Path path(const Vec2& start)

Start drawing an outline segment by segment at start; see Path.

Profile::parabola()

static Path parabola(const Vec2& vertex, const Vec2& axis, double focal, double from, double to)

Start drawing on the arc of the parabola with vertex, axis direction axis and focal length focal, over the across-axis coordinates from..to: the path begins at the arc's first point and holds the arc as one conic segment — a reflector from rim to rim; parabola((0, 0), (0, 1), 20, -50, 50) is a dish 100 wide opening up. A zero axis, a focal length not positive and finite, or from not under to returns an Error in its Result.

Profile::chain()

static Result<Profile> chain(const Profiles& pieces, std::optional<double> tolerance = 1e-6)

Open profiles — paths ended open — joined end to end into one: the forge's merge. They may come in any order and either way round: each next piece is the first of the rest with an end within tolerance (1e-6 by default) of either end of the chain so far, reversed where that makes it meet. Every segment is kept exactly — a line a line, an arc an arc, a spline the same spline. Closed where the chain's two ends meet, otherwise an open chain. A piece that is empty, has holes, is closed on its own or meets none of the others returns an Error in its Result naming it by its index.

Profile::from_loops()

static Result<Profile> from_loops(const Profiles& loops)

Closed loops, in any order, as one profile: the loop enclosing the most area is the boundary and every other a hole in it, in the order given — a sketch's rectangle and the circles drawn inside it. Each loop is a closed profile with no holes of its own, wound either way; one that closes within rounding is closed exactly. A loop that is open, empty or encloses no area, loops that cross or touch, a hole outside the boundary, or one inside another hole (an island) returns an Error in its Result, naming the loops by their index.

Profile::close_loop()

Result<Profile> close_loop() const

This profile closed — the forge's sketch "close": where its last segment stops short of its start (a path ended open), a straight segment back to it; where it already comes back within 1e-9 of its extent, its last segment made to land on the start exactly. A closed profile comes back as it is, and holes are closed the same way.

Profile::polyline()

static Result<Profile> polyline(const std::vector<Vec2>& points, bool closed = false)

A polyline through points in order, a straight segment per side: an open chain, or with closed a side from the last point back to the first. A side of no length is kept, so a corner dragged onto its neighbour still draws. Fewer than two points (three closed) returns an Error in its Result.

Profile::arc()

static Result<Profile> arc(const Vec2& centre, double r, double a0, double a1)

The arc of radius r about centre from angle a0 counter-clockwise to a1 (radians from the sketch's x axis): one exact arc, open, the sweep taken the counter-clockwise way round. Equal angles are the whole circle, closed, starting at a0 — a circle anywhere on the sketch. A radius not positive and finite returns an Error in its Result.

Profile::arc_through()

static Result<Profile> arc_through(const Vec2& start, const Vec2& through, const Vec2& end)

The arc from start through through to end: one exact arc leaving the start, open — the circle through the three points, swept the way round that passes through. Three points in a line returns an Error in its Result.

Profile::gear_involute()

static Result<GearProfile> gear_involute(double module, std::uint32_t teeth, const GearInvoluteOptions& options = GearInvoluteOptions())

An involute spur gear of teeth teeth of module, tooth 0 centred on the sketch's x axis, as a GearProfile: the flanks NURBS within tolerance of the true involute, the tips, root fillets and root arcs exact — one closed outline that extrudes, cuts and exports as any other. std::nullopt is the default: pressure_angle 20 degrees (radians), shift 0, addendum 1 and dedendum 1.25 (factors of the module), root_fillet 0.38 module, backlash 0 (taken off this gear's tooth), tolerance 1e-4 module. Undercut is flagged in the report, not drawn. Fewer than 4 teeth, a module not positive, a pressure angle outside (0, pi/4), a pointed tooth or a root fillet that does not fit returns an Error in its Result; cadaclysm::blacksmith::gear_centre_distance_involute() places its mate.

Profile::gear_wheel_cycloidal()

static Result<GearProfile> gear_wheel_cycloidal(double module, std::uint32_t teeth, std::uint32_t pinion_leaves, const GearWheelCycloidalOptions& options = GearWheelCycloidalOptions())

A cycloidal clock wheel of teeth teeth of module driving a pinion of pinion_leaves leaves, tooth 0 centred on the sketch's x axis, as a GearProfile: addendum flanks within tolerance of the true epicycloid rolled by a circle of half the pinion's pitch radius, radial dedendum flanks, fillets and root arcs exact. std::nullopt is the default: thickness pi module / 2, addendum up to the flanks' crossing with the point rounded, dedendum 1.57 (a factor of the module), root_fillet 0.25 module, tolerance 1e-4 module. The centre distance to the pinion is the two reports' pitch radii added. A pinion of under 6 leaves, a wheel no larger than it, a size not positive or a fillet that does not fit returns an Error in its Result.

Profile::gear_pinion_cycloidal()

static Result<GearProfile> gear_pinion_cycloidal(double module, std::uint32_t leaves, std::uint32_t wheel_teeth, const GearPinionCycloidalOptions& options = GearPinionCycloidalOptions())

A cycloidal clock pinion of leaves leaves of module driven by a wheel of wheel_teeth teeth, leaf 0 centred on the sketch's x axis, as a GearProfile: radial flanks inside the pitch circle and a tip "round" (a semicircle of half the leaf thickness) or "ogive" (the epicycloid, truncated at 0.855 module). std::nullopt is the default: thickness 1.05 module (6 to 10 leaves) or 1.25 module, clearance 0.4 module below the wheel's addendum, root_fillet 0.25 module, tolerance 1e-4 module. Under 6 leaves, a wheel no larger than the pinion, a size not positive, a negative clearance, a tip that is neither or a fillet that does not fit returns an Error in its Result.

Profile::ellipse()

static Result<Profile> ellipse(const Vec2& centre, double rx, double ry)

The ellipse about centre with semi-axes rx along x and ry along y, closed: four exact quarter conics, counter-clockwise from the point rx along x. A semi-axis not positive and finite returns an Error in its Result.

Profile::from_beziers()

static Result<Profile> from_beziers(const std::vector<double>& beziers, bool recognise = true)

Rational cubic Béziers end to end as one open profile — sixteen numbers each, x y z w per control point (the point, then its weight), the record Profile::beziers() hands back. With recognise (the default) a straight Bézier becomes an exact line and a circular one an exact arc, so a trim, an extrusion or a fillet meets lines and cylinders; without it every Bézier is kept as the exact cubic it is, and Profile::chain() or Profile::close_loop() hands the same Béziers back. No Béziers, a number not finite or a weight not positive returns an Error in its Result.

Profile::beziers()

Result<std::vector<double>> beziers(const std::optional<FrameLike>& frame = std::nullopt) const

This profile as rational cubic Béziers, sixteen numbers each — x y z w per control point, the point and its weight: a line one straight Bézier, an arc exact conic pieces of a quarter turn or less, a free-form side its own decomposition; the outline from its start, then each hole's. On the sketch plane (z = 0), or with frame carried onto that frame's plane — what a page draws a curve with.

Profile::loops()

static Result<std::vector<std::vector<std::uint32_t>>> loops(const Profiles& pieces, std::optional<double> tolerance = 1e-6)

The closed loops among pieces, each read by its two ends, the way a CAD sketch finds them: ends meet within tolerance; a loop is a chain of pieces through corners where exactly two ends meet (a corner of three or more is ambiguous, and no loop runs through it); a piece whose own ends meet, a closed one included, is a loop of its own. Each loop is its pieces' indices in the order it runs, from its lowest; each piece is in at most one. A piece with holes or nothing drawn returns an Error in its Result.

Profile::chain_order()

static Result<std::vector<std::pair<std::uint32_t, bool>>> chain_order(const Profiles& pieces, std::optional<double> tolerance = 1e-6)

The order Profile::chain() takes pieces in, from the chain's start to its end: per piece its index and whether it was turned round to meet — what reorders a sketch's own curve list to match the chained profile. Refused as Profile::chain() is.

Profile::from_pieces()

static Result<Profile> from_pieces(const std::string& json, bool closed = false, std::optional<double> tolerance = std::nullopt)

A profile from piece definitions in the curve.polycurve grammar — a line {kind, x0, y0, x1, y1}, an arc through xm, ym, a circle, an ellipse, a rect, a polygon, a polyline or a spline — each made exact, put in chain order and turned to run on, joined where ends meet within tolerance (none: the pieces' effective tolerance). Closed where the chain's ends meet, or with a closing side when closed asks. What Profile::pieces_json() writes reads back to the same profile. A piece it cannot read, or pieces that do not chain, returns an Error in its Result, naming the piece by index.

Profile::pieces_json()

Result<std::string> pieces_json() const

This profile's outline as piece definitions, one per segment from its start: a line {x0, y0, x1, y1}, an arc {x0, y0, xm, ym, x1, y1} through its middle (a whole circle as two halves), anything else a cubic spline piece per Bézier — what an app stores and edits, and what Profile::from_pieces() reads back. A profile with holes returns an Error in its Result.

Profile::fillet_corner()

static Result<std::string> fillet_corner(const Profile& a, const Profile& b, double radius, std::optional<double> tolerance = std::nullopt)

A sketch fillet between two open profiles that meet at an end, within tolerance: both cut back to the tangent points, each still running the way it ran, and the arc from the first's side to the second's, all as pieces Profile::from_pieces() reads — {a, b, arc}. Profiles that do not meet at an end, run straight on or fold back, or a radius that does not fit, returns an Error in its Result.

Profile::bounds()

Result<std::array<double, 4>> bounds() const

The exact box of this profile in its sketch — min x, min y, max x, max y — over the outline and the holes, from the curves' own extremes rather than their control points: an arc's bulge is in it, a spline's control polygon is not.

Profile::reversed()

Result<Profile> reversed() const

This profile walked the other way, as a new one: its end the new start, its segments in reverse order, each turned round; each hole turned round in place. Twice is the profile.

Profile::pieces()

Result<std::vector<Profile>> pieces(const Profiles& cutters, std::optional<double> tolerance = 1e-6) const

This curve cut where the cutters cross, touch or run along it — the sketch trim's pieces: in order along the curve from its start, each an open profile of portions of this one's own segments (a line's stretch a line, an arc's an arc, a spline's the same spline over part of its domain, nothing refitted). One piece, this curve, where nothing cuts it; a closed curve's piece round its start is one piece. Cuts closer than tolerance to each other fold onto one. A curve with no segments returns an Error in its Result.

Profile::trim()

Result<std::vector<Profile>> trim(const Profiles& cutters, std::uint32_t piece, std::optional<double> tolerance = 1e-6) const

This curve with piece piece of Profile::pieces() taken away — the sketch trim, the forge's: what is left, as open profiles. One for a closed curve (its other pieces run together from where the removed one ended), the stretches before and after for an open one, none where the piece was the whole curve. A piece the curve does not have returns an Error in its Result.

Profile::with_hole()

Result<Profile> with_hole(const Profile& hole) const

This outline with hole cut out of it.

Profile::hits()

Result<std::vector<Hit>> hits(const Profile& other, std::optional<double> tolerance = HIT_TOLERANCE) const

Where this outline's curves cross, touch or run along other's, both read in one plane, as Hit values ordered along this outline. Points closer than tolerance merge; two curves within tolerance of each other for longer than it are one run when they part only where one of them ends or the stretch is flat — one curve following the other, offset within tolerance or tilted by under about half of it, even where it leaves mid-both; a tangency or a shallow crossing is one point. A loop that stops short of its start is an open chain, its closing side not tested.

Profile::common()

Result<std::vector<Profile>> common(const Profile& other, std::optional<double> tolerance = HIT_TOLERANCE) const

The region this outline and other share, both read in one plane, as a list of zero or more profiles — each boundary counter-clockwise, each hole clockwise, arcs and splines kept exact. An arc kept from an input can still come out split at that input's own seam point (two circles' lens is four arcs, one pair per circle) — exact, not an approximation. Two loops of a result may touch at a point (two holes whose corners meet, one from each input): a right point set that the verbs needing simple loops — Solid::extrude(), a boolean taking it as an input — refuse. Both must be closed and simple; no shared area is an empty list. A tolerance not positive and finite, an outline open or crossing itself, a tolerance too fine for these outlines (following their arcs and splines to a tenth of it would take more than 8 million points, about 128 MB), and, as a defect rather than an outcome, a result that fails to close, returns an Error in its Result.

Profile::translate()

Result<Profile> translate(double dx, double dy) const

This outline moved by (dx, dy).

Profile::rotate()

Result<Profile> rotate(const Vec2& centre, double radians) const

This outline turned radians (counter-clockwise) about centre.

Profile::scale()

Result<Profile> scale(const Vec2& centre, double sx, double sy) const

This outline scaled by sx, sy about centre. An arc stays an arc where the two are equal in size, and becomes exact conics (rational quadratics) otherwise; a negative factor mirrors across that axis, and a zero one returns an Error in its Result.

Profile::mirror()

Result<Profile> mirror(const Vec2& point, const Vec2& direction) const

This outline reflected across the line through point along direction; each arc's sense turns. A zero direction returns an Error in its Result.

Profile::transform2d()

Result<Profile> transform2d(const std::array<double, 6>& m) const

This outline under the 2D affine map m, six numbers row-major (2×3): x' = m0·x + m1·y + m2, y' = m3·x + m4·y + m5. Lines, Béziers, conics and NURBS map by their points, exactly; a singular map returns an Error in its Result.

Profile::coloured()

Result<Profile> coloured(const Vec3& rgb_value) const
Result<Profile> coloured(std::string_view colour) const

A new outline coloured (r, g, b), each 0..1, "#rgb", "#rrggbb" or a CSS colour name ("tomato", "RebeccaPurple"): how it is drawn. The verbs that make a profile from one carry it (translate, round, with_hole keeps the outer's, chain and from_loops the first's); a solid made from it takes nothing — colour a solid with Solid::coloured().

Takes a Vec3, or, as a std::string_view overload, colour text through blacksmith::rgb().

Profile::colour()

Result<std::optional<Vec3>> colour() const

The outline's colour as (r, g, b), or none.

Profile::round()

Result<Profile> round(double radius, const std::optional<std::vector<std::uint32_t>>& corners = std::nullopt, bool as_open = false) const

This outline with its corners rounded by radius: at each corner both segments are cut back — lines, arcs and splines alike, each staying the curve it was — and an exact arc tangent to both goes between them. A corner the two run straight on through is no corner. With no corners every corner is rounded, the holes' too; a list picks corners of the outline — corner k is where segment k ends, and a picked corner that runs straight on is refused. open reads the profile as an open chain whose two ends stay square. A radius that does not fit returns an Error in its Result naming the corner.

Profile::to_arcs()

Result<Profile> to_arcs(std::optional<double> tolerance = 0.01) const

This profile with every free-form side (a Bezier, a conic, a NURBS) replaced by lines and arcs within tolerance of it — what a G-code writer can say. Lines and arcs pass through as they are, every loop closes on itself exactly, holes are converted the same way. tolerance (0.01 by default) not positive and finite, or a spline that does not evaluate, returns an Error in its Result.

Profile::offset()

Result<std::vector<Profile>> offset(double distance, std::optional<double> tolerance = 0.01, OffsetCorner corner = OffsetCorner::round) const

This profile grown by distance (shrunk where it is negative), as zero or more profiles, all lines and arcs: outward corners rounded by |distance|, holes moving against the boundary (a hole shrinks as the profile grows). Free-form sides are fitted to tolerance first (Profile::to_arcs()). A shrink that eats the whole profile is an empty list. corner styles every corner where the moved sides part: round (the arc about the corner, the default), sharp (the sides extended along their tangents until they meet; chamfered past a miter of 100 times the distance), smooth (the parabola tangent to both sides, an exact conic) or chamfer (a line across). A distance not finite, a tolerance (0.01 by default) not positive and finite, a loop with no sides, loops that cross or touch, or another style, returns an Error in its Result.

Profile::offset_open()

Result<std::vector<Profile>> offset_open(double distance, std::optional<double> tolerance = 0.01, OffsetCorner corner = OffsetCorner::round, OffsetEnd end = OffsetEnd::none) const

This profile read as an open chain (its implicit closing side and holes ignored), offset by distance. With no end style: the one-sided offset, open chains moved distance to the right of travel (negative, the left), the overlaps at inside corners trimmed. Ends flat or round: the closed outline both sides at |distance|, each end capped by a line across or a half circle. corner styles the joins as Profile::offset() does. A distance not finite (or 0 with ends), a chain with no sides, or another style, returns an Error in its Result.

Profile::union_()

Result<std::vector<Profile>> union_(const Profile& other, std::optional<double> tolerance = HIT_TOLERANCE) const

The region this outline or other covers, both read in one plane, as zero or more profiles — each boundary counter-clockwise, each hole clockwise, arcs and splines kept exact. Both must be closed and simple; refused as Profile::common() is.

Profile::difference()

Result<std::vector<Profile>> difference(const Profile& other, std::optional<double> tolerance = HIT_TOLERANCE) const

The region of this outline that other does not cover, as zero or more profiles, exact as Profile::union_(); refused as Profile::common() is.

Profile::regions()

static Result<std::vector<Profile>> regions(const Profiles& profiles, std::optional<double> tolerance = HIT_TOLERANCE)

Every region the closed profiles split the plane into, each once, exact: two overlapping squares are three regions. Which inputs hold a region: those it Profile::relationship()s as inside or equal. A boolean's refusal returns an Error in its Result naming the input.

Profile::contains()

Result<Containment> contains(const Vec2& point, std::optional<double> tolerance = HIT_TOLERANCE) const

Where point lies against this closed outline: on within tolerance of any loop (holes included; the distance exact to lines, arcs and splines), else inside or outside by the even-odd rule. An open chain is read closed by its implicit side. A profile with no segments or a point not finite returns an Error in its Result.

Profile::relationship()

Result<Relation> relationship(const Profile& other, std::optional<double> tolerance = HIT_TOLERANCE) const

How this closed outline's region stands to other's: disjoint (no point in common), touching (the boundaries meet, the interiors do not overlap), overlapping (the interiors overlap and neither holds the other), a inside b (this one inside other), b inside a, or equal (one region, to the tolerance). An input open or crossing itself returns an Error in its Result.

Profile::deviation()

Result<Deviation> deviation(const Profile& other, std::optional<double> tolerance = HIT_TOLERANCE) const

The largest and smallest distance between this outline and other's (every loop), both ways round, with the two points of each: a Deviation. Every figure within tolerance of the true one. A profile with no segments or a spline that does not evaluate returns an Error in its Result.

Profile::reduce_segments()

Result<Profile> reduce_segments(std::optional<double> tolerance = 0.01, bool as_open = false) const

This outline with every run of consecutive straight segments simplified by Douglas–Peucker within tolerance: a vertex goes where the run stays within tolerance of it. Arcs, splines and the ends of every run are kept. open reads it as an open chain.

Profile::merge_colinear()

Result<Profile> merge_colinear(double angle_tolerance = 1e-9, bool as_open = false, bool include_seam = true) const

This outline with neighbouring segments that are one curve made one: two lines turning less than angle_tolerance radians, two arcs on one circle turning one way (never a full circle). include_seam merges a closed loop's last and first segments too. An angle outside [0, pi) returns an Error in its Result.

Profile::break_at_kinks()

Result<std::vector<Profile>> break_at_kinks(double angle, bool as_open = false) const

The outer loop cut into open pieces wherever the direction of travel turns by more than angle radians at a joint. A closed loop with no kink comes back whole; with kinks, as open pieces starting at its first. An angle outside [0, pi] or no segments returns an Error in its Result.

Profile::is_convex()

Result<bool> is_convex(bool strict = false) const

Whether this closed outline is convex: no holes, and its outer loop turns one way only (every joint, arc and spline) through one full turn. strict also refuses a joint between two lines that does not turn.

Profile::make_closed()

Result<Profile> make_closed(std::optional<double> tolerance = HIT_TOLERANCE) const

This open chain closed by moving its end onto its start where the two are within tolerance: a line's end moves, an arc's centre moves onto the bisector of its new chord, a Bézier's end moves with its last inner control point, a spline's last control point moves. A wider gap, or a chain that closed would enclose nothing, returns an Error in its Result.

Profile::with_seam()

Result<Profile> with_seam(const Vec2& point) const

This closed outline with its outer loop restarted at its point nearest point: the segment there split exactly and the loop rotated; a point at a joint rotates it without a split. Holes kept.

Profile::document_path()

Result<std::string> document_path() const

This profile as its exact segments, as a Document's profile.path node holds it: a record of its start, its segments (each a line, arc, bezier, conic or nurbs with its points, weights and knots, never flattened), its holes and its colour. What Document::add_profile() puts in a document.

Profile::polylines()

Result<ProfilePolylines> polylines(std::optional<double> tolerance = DEFAULT_TOLERANCE) const

The outline, then each hole, as polylines at z = 0 within tolerance of its arcs and splines — what a viewer draws it with. A closed loop repeats its first point at the end; an open chain (a profile ended open) stays open. Views, like Solid::mesh() — copies in Node, Godot and Python.

Returns a view into the profile's cache: asking again at another tolerance makes it stale (a bad access in checked mode).

Profile.show

Draw the outline and holes with the viewer in use, from the top by default. Keywords as Solid::show(); edges= is ignored, the lines being the whole picture. With the GPU library (import cadaclysm.view.wgpu) the drawing replaces what one shared window shows and stays live — at the REPL, in IPython and in Jupyter by themselves, in a script until it exits; cadaclysm.view.View draws several items or several windows.

Comes with the viewers follow-up.

Profile.view

Orbit the outline with the viewer in use; returns the camera where it was left — a dict of eye, target, up, orthographic, azimuth and elevation — and pick, what was last clicked (item, node, face) or None. A fresh window, run until closed, with the GPU library.

Comes with the viewers follow-up.

Profile::svg()

Result<void> svg(const std::string& path, const SvgOptions& options = SvgOptions{SvgView::top}) const

This profile's own loops as SVG: a line a line, an arc an arc, a spline the NURBS' own Béziers — exact curves, nothing flattened to the polyline Profile::polylines() samples. The keywords are cadaclysm::blacksmith::write_svg()'s own, except view= defaults to top here rather than iso: a profile lies in z = 0, so its own plane is already the page and it reads flat and true. In the languages whose options are a struct (view already iso, not nullable), that default holds only when no options value is passed at all — pass one for anything else and its own view applies. With path, writes the file and returns std::nullopt; without, returns the SVG text. returns an Error in its Result on a refused option or a failed write.

Profile::length()

Result<Length> length(double accuracy = 0.0) const

The perimeter of the outer loop — holes are not counted — as a Length: its exact curves measured to the relative accuracy, 0 asking for measure.default_accuracy (see cadaclysm::blacksmith::set_option()). An accuracy of NaN, infinite or 1 or more returns an Error in its Result.

Profile::area_properties()

Result<AreaProperties> area_properties(std::optional<double> accuracy = std::nullopt) const

The region's area properties in the profile's own plane, as an AreaProperties: the outer loop less its holes, whatever their winding — Fusion's Profile.areaProperties, Rhino's AreaMassProperties of closed planar curves. Lines and arcs in closed form, polynomial splines exactly, rational ones to the relative accuracy (none or 0: 1e-9). An accuracy outside (0, 1), or a hole with holes of its own, returns an Error in its Result.

Profile::point_at_length()

Result<At> point_at_length(double s, double accuracy = 0.0) const

The point at arc length s along the outer loop, as an At: s is absolute, measured from the loop's start, and lies in [0, length] (see Profile::length()) — past either end by no more than the length's own error is that end, further returns an Error in its Result. The sample names its side in segment, and parameter is that side's own: a line's 0 to 1, an arc's angle about its centre (a clockwise arc's angle decreasing along it), a spline's parameter. accuracy is relative, 0 or less asking for measure.default_accuracy; NaN, infinite or 1 or more returns an Error in its Result.

Profile::divide_by_count()

Result<std::vector<At>> divide_by_count(std::uint32_t n, double accuracy = 0.0) const

The outer loop in n pieces of equal arc length, as a list of At: a profile is closed, so n samples from its start, never the start again. n is 1 to 1,000,000; accuracy as Profile::point_at_length().

Profile::divide_by_length()

Result<std::vector<At>> divide_by_length(double step, double accuracy = 0.0) const

Samples of the outer loop every step of arc length from its start, as a list of At: the last piece is whatever is left over, kept short, and the start is never repeated. step is positive and finite and may give at most 999,999 steps; accuracy as Profile::point_at_length().

Path

class Path

An outline drawn a segment at a time — lines, arcs, Béziers, NURBS — then closed into a Profile. Ending it consumes the builder.

Path::line_to()

Path& line_to(double x, double y) &

A straight segment to (x, y).

Path::arc_to()

Path& arc_to(double x, double y, const Vec2& centre, bool ccw = true) &

A circular arc to (x, y) about centre, counter-clockwise unless ccw is false.

Path::bezier_to()

Path& bezier_to(const Vec2& c1, const Vec2& c2, const Vec2& to) &

A cubic Bézier through control points c1, c2 to to.

Path::conic_to()

Path& conic_to(const Vec2& to, const Vec2& control, double weight) &

A conic arc to (x, y) through the control point control with middle weight: under 1 an elliptical arc, 1 a parabola, over 1 a hyperbola — the rational quadratic Bézier, kept exact. A weight not positive and finite, an end on the current point, or a control point on the chord returns an Error in its Result.

Path::parabola_to()

Path& parabola_to(const Vec2& to, const Vec2& control) &

A parabolic arc to (x, y) whose end tangents meet at control: Path::conic_to() with weight 1.

Path::hyperbola_to()

Path& hyperbola_to(const Vec2& to, const Vec2& control, double weight) &

A hyperbolic arc to (x, y) through control with middle weight over 1; a weight of 1 or under returns an Error in its Result.

Path::parabola_by_vertex()

Path& parabola_by_vertex(const Vec2& to, const Vec2& vertex) &

The parabolic arc to (x, y) whose vertex is vertex: the axis and focal length are solved from the two ends. A vertex on the chord, or one no parabola through both ends has (the vertex must be the arc's extreme point), returns an Error in its Result.

Path::parabola_by_focus()

Path& parabola_by_focus(const Vec2& to, const Vec2& focus) &

The parabolic arc to (x, y) whose focus is focus: of the two parabolas through the ends with that focus, the one whose vertex lies between the ends' projections, then the one whose arc cups the focus (the focus between the arc and its chord), then the more symmetric; with the focus beyond the chord that is the arch over the ends, not the shallow dish — draw that one with Profile::parabola(). A focus on the chord returns an Error in its Result.

Path::nurbs_to()

Path& nurbs_to(const std::vector<Vec2>& control, const std::vector<double>& knots, std::uint32_t degree, const std::optional<std::vector<double>>& weights = std::nullopt) &

A NURBS segment: control is every control point after the current one, the endpoint last; knots the full knot vector; weights one per control point including the current one, or std::nullopt for a non-rational curve.

Path::end()

Result<Profile> end()

Close the outline back to its start and return the Profile.

Path::end_open()

Result<Profile> end_open()

The path as it stands, not closed: an open chain for Solid::extrude_open(), Solid::sweep_open() or Solid::loft_open().

err C++ only

const Error* err() const noexcept
const Error* err() const noexcept
const Error* err() const noexcept

The builders latch: a step that fails keeps its error and every later step is skipped, so a chain reads without a check per step — Profile::path({0, 0}).line_to(10, 0).line_to(10, 5).end(). end(), end_open() or solid() return the error; err() shows it early, a null pointer while all is well. Path(start) is the same as Profile::path().

SweepPath

class SweepPath

The 3D path a profile is carried along by Solid::sweep(): lines and circular arcs. Sweeping only borrows it, so one path can be swept many times; close it when done.

SweepPath::at()

static SweepPath at(const Vec3& point)

Start a path at a 3D point.

SweepPath::along()

static SweepPath along(const Profile& curve, const Frame& frame, std::optional<double> tolerance = DEFAULT_TOLERANCE, bool leave_open = true)

The path a 2D chain (usually from Path::end_open()) draws on frame: a line a straight piece, an arc a circular one, a Bézier or spline fitted with biarcs — arcs tangent to each other and to the curve — within tolerance, so the path is tangent throughout and the sweep exact along it. open false closes the path back to its start.

SweepPath::line_to()

SweepPath& line_to(const Vec3& point) &

A straight piece to a 3D point.

SweepPath::arc()

SweepPath& arc(const Vec3& centre, const Vec3& axis, double angle) &

Turn angle radians (in (0, 2π]) about the axis through centre along axis.

SweepPath::close()

void close() noexcept

Free the path.

Slant

struct Slant

A plane a Solid::extrude_between() starts or ends on, read as a height over the sketch plane at each point: at + grad · (x, y). Flat for an ordinary cap; sloped for a mitre.

Slant::at

double at

The height at the sketch origin.

Slant::grad

Vec2 grad

The slope in x and y.

Slant::flat()

static Slant flat(double height)

A flat plane at height at.

Slant::of_plane()

static Result<Slant> of_plane(const Frame& frame, const Vec3& point, const Vec3& normal)

The plane through point square to normal, as heights over frame. A plane that contains the extrusion direction has no height and returns an Error in its Result.

Frame

class Frame

A frame built for you instead of twelve numbers typed out: an origin and three unit axes, square to each other and right-handed (z = x × y). It goes wherever a frame does. Immutable. The constructor takes the origin and the three axes, normalises them, and returns an Error in its Result when they are not square or not right-handed. Every way to a Frame also refuses an origin that is not three finite numbers, returning an Error in its Result.

Frame::xy()

static Result<Frame> xy(const Vec3& o = {0, 0, 0})

The world XY plane through origin: z up, as Workplane::xy().

Frame::xz()

static Result<Frame> xz(const Vec3& o = {0, 0, 0})

The world XZ plane through origin: x along X, y along Z, so z is -Y, as Workplane::xz().

Frame::yz()

static Result<Frame> yz(const Vec3& o = {0, 0, 0})

The world YZ plane through origin: x along Y, y along Z, so z is +X, as Workplane::yz().

Frame::at()

static Result<Frame> at(const Vec3& o, const Vec3& normal, const std::optional<Vec3>& x_hint = std::nullopt)

The plane through origin square to normal, which becomes the frame's z (it need not be unit). Its x axis is x laid onto that plane; with none, world X laid onto it, or world Y when the normal is within about 25° of X — the axes Solid::face_frame() gives a face facing normal. So a normal along +Z, -Y or +X gives exactly Frame::xy(), Frame::xz() or Frame::yz(). A zero normal, or an x along the normal, returns an Error in its Result.

Frame::of()

static Result<Frame> of(const std::array<double, 12>& raw)

Twelve numbers — what Solid::face_frame() and Workplane::frame() hand back — as a checked frame, to read its axes or move it.

Frame::midplane()

static Result<Frame> midplane(const Frame& a, const Frame& b)

The plane midway between the planes of frames a and b: for parallel planes the one halfway between, on a's axes; for planes that meet, the plane bisecting them through the line they meet on, its x along that line.

Frame::through()

static Result<Frame> through(const Vec3& p, const Vec3& q, const Vec3& r)

The plane through the points p, q and r: its origin p, its x towards q, its z the normal the three turn about counter-clockwise. Three points on one line returns an Error in its Result.

Frame::origin()

Vec3 origin() const noexcept
Vec3 x() const noexcept
Vec3 y() const noexcept
Vec3 z() const noexcept

The origin and the three axes, each three numbers.

Frame::translate()

Result<Frame> translate(double dx, double dy, double dz) const

This frame moved by (dx, dy, dz) in world coordinates.

Frame::offset()

Result<Frame> offset(double distance) const

This frame moved distance along its own z: Frame::xy() and offset() return Result<Frame>, so Frame::xy().and_then([](Frame f) { return f.offset(5); }) is the XY plane at z = 5.

Frame::fit()

static Result<std::pair<Frame, double>> fit(const std::vector<Vec3>& points)

The least-squares plane through points (three or more, not all on one line) as a frame, and the largest distance any point lies off it: (frame, deviation). Fewer points, or points on one line, returns an Error in its Result.

Frame::flip()

Frame flip() const noexcept

The same plane facing the other way: x and y swapped, z reversed.

Frame::rotate()

Result<Frame> rotate(double radians, const Vec3& axis) const

This frame turned radians about axis through its origin, right-handed.

Frame::to_local()

Vec3 to_local(const Vec3& p) const noexcept

The point p in this frame's coordinates.

Frame::closest_point()

Vec3 closest_point(const Vec3& p) const noexcept

The point p dropped onto the frame's plane along its z.

Frame::distance_to()

double distance_to(const Vec3& p) const noexcept

How far p lies above the frame's plane, along its z: negative below.

Frame::make C++ only

static Result<Frame> make(const Vec3& o, const Vec3& xa, const Vec3& ya, const Vec3& za)
const std::array<double, 12>& raw() const noexcept

Python's Frame(origin, x, y, z), checked, and the twelve numbers a frame stands for.

Transform

class Transform

An affine map of space: a 4×4 matrix, row-major, its bottom row 0 0 0 1 (a projective one returns an Error in its Result). Immutable, with nothing to free; it iterates as its 16 numbers. a @ b is a after b. The constructors and decompositions are the library's own, so every language computes them alike. A frame argument is a Frame or 12 numbers: one within 1e-6 of right-handed and orthonormal is squared up, any other returns an Error in its Result.

Transform::from_rows()

static Result<Transform> from_rows(std::initializer_list<double> rows)
static Result<Transform> from_rows(const std::vector<double>& rows)
static Result<Transform> from_rows(const std::array<double, 16>& rows)
static Result<Transform> from_rows(const Matrix4& rows)

The map 16 numbers state, row-major, or four rows of four.

Transform::identity()

static Transform identity() noexcept

The map that moves nothing.

Transform::translation()

static Result<Transform> translation(const Vec3& v)

p + v.

Transform::rotation()

static Result<Transform> rotation(const Vec3& point, const Vec3& direction, double radians)
static Result<Transform> rotation(const AxisLine& axis, double radians)

A turn of radians about the line through point along direction, right-handed.

Transform::mirror()

static Result<Transform> mirror(const Frame& plane)
static Result<Transform> mirror(const std::array<double, 12>& plane)

The reflection across plane, its z the normal.

Transform::scale()

static Result<Transform> scale(const Vec3& centre, double k)

A uniform scale by k about centre.

Transform::scale_xyz()

static Result<Transform> scale_xyz(const Frame& frame, double sx, double sy, double sz)
static Result<Transform> scale_xyz(const std::array<double, 12>& frame, double sx, double sy, double sz)

A scale by sx, sy, sz along frame's axes, about its origin.

Transform::shear()

static Result<Transform> shear(const Frame& plane, const Vec3& direction, double factor)
static Result<Transform> shear(const std::array<double, 12>& plane, const Vec3& direction, double factor)

Every point slid along direction by factor times its height above plane. direction is normalised, so factor alone sets the slide; one off the plane returns an Error in its Result.

Transform::plane_to_plane()

static Result<Transform> plane_to_plane(const Frame& a, const Frame& b)
static Result<Transform> plane_to_plane(const std::array<double, 12>& a, const std::array<double, 12>& b)

The rigid map sending frame a onto frame b.

Transform::change_basis()

static Result<Transform> change_basis(const Frame& from, const Frame& to)
static Result<Transform> change_basis(const std::array<double, 12>& from, const std::array<double, 12>& to)

Coordinates in frame from_ to coordinates in frame to.

Transform::planar_projection()

static Result<Transform> planar_projection(const Frame& plane)
static Result<Transform> planar_projection(const std::array<double, 12>& plane)

The orthogonal projection onto plane (singular by design).

Transform::project_along()

static Result<Transform> project_along(const Frame& plane, const Vec3& direction)
static Result<Transform> project_along(const std::array<double, 12>& plane, const Vec3& direction)

The parallel projection onto plane along direction; a direction in the plane returns an Error in its Result.

Transform::rows()

const std::array<double, 16>& rows() const noexcept

The 16 numbers, row-major.

Transform::point()

Vec3 point(const Vec3& p) const noexcept

Where the map takes the point p.

Transform::inverse()

Result<Transform> inverse() const

The map undoing this one; a singular map returns an Error in its Result.

Transform::is_rigid()

Result<bool> is_rigid(double tolerance = MAP_TOLERANCE) const

Whether the linear part is orthogonal (AᵀA = I to tolerance, 1e-9 by default): a rotation or a mirror.

Transform::is_similarity()

Result<std::optional<double>> is_similarity(double tolerance = MAP_TOLERANCE) const

The scale k where the linear part is k times an orthogonal one (to tolerance, relative to k²); std::nullopt otherwise.

Transform::decompose_rigid()

Result<std::optional<RigidParts>> decompose_rigid(double tolerance = MAP_TOLERANCE) const

(translation, orthogonal part) for a rigid map; std::nullopt otherwise.

Transform::decompose_similarity()

Result<std::optional<SimilarityParts>> decompose_similarity(double tolerance = MAP_TOLERANCE) const

(translation, orthogonal part, k) for a similarity; std::nullopt otherwise.

Transform::decompose_affine()

std::optional<AffineParts> decompose_affine() const

(translation, rotation, axes, stretch) with the linear part rotation · axes · diag(stretch) · axesᵀ: rotation carries the mirror, axes is a proper rotation whose columns are the stretch directions, the stretches come largest first. std::nullopt for a singular map, or one stretched past 1e7:1.

Quaternion

class Quaternion

A rotation as w + xi + yj + zk. Immutable; it iterates as w, x, y, z. q and -q are the same rotation; a non-unit one is normalised where it becomes a rotation, and a zero one returns an Error in its Result there. a * b turns by b, then by a.

Quaternion::from_axis_angle()

static Result<Quaternion> from_axis_angle(const Vec3& direction, double radians)

The turn of radians about direction, right-handed.

Quaternion::from_transform()

static Result<Quaternion> from_transform(const Transform& t)

The rotation in t's linear part (its translation ignored); anything but a proper rotation returns an Error in its Result.

Quaternion::slerp()

static Result<Quaternion> slerp(const Quaternion& a, const Quaternion& b, double s)

From a (s = 0) to b (s = 1) along the shorter arc.

Quaternion::to_transform()

Result<Transform> to_transform(const Vec3& centre = {0, 0, 0}) const

This rotation as a Transform fixing centre.

Quaternion::w()

double w() const noexcept
double x() const noexcept
double y() const noexcept
double z() const noexcept

The four numbers.

Quaternion::length()

double length() const noexcept

Its length; 1 for a rotation as made here.

Quaternion::angle()

double angle() const noexcept

The turn, in [0, 2π].

Quaternion::axis()

std::optional<Vec3> axis() const

The turn's axis; std::nullopt for the identity.

Quaternion::conjugate()

Quaternion conjugate() const noexcept

The opposite turn.

Quaternion::normalize()

Result<Quaternion> normalize() const

This quaternion at length 1; a zero one returns an Error in its Result.

Interval

class Interval

A parameter range t0..t1, in either order: length and swapped keep the order, the set operations (grown, union, intersect) answer increasing. Immutable and hashable; it iterates as (t0, t1), so two numbers go wherever an Interval does. The values' angle and height ranges and the surfaces' domains are intervals.

Interval::of()

static Result<Interval> of(const Interval& value)
static Result<Interval> of(const std::vector<double>& values)

An Interval, or two numbers, as an Interval; any other count returns an Error in its Result.

Interval::t0()

double t0() const noexcept
double t1() const noexcept

The two ends, as given.

Interval::length()

double length() const noexcept

t1 - t0: negative for a decreasing interval.

Interval::mid()

double mid() const noexcept

The middle, (t0 + t1) / 2.

Interval::min()

double (min)() const noexcept
double (max)() const noexcept

The smaller and the larger end.

Interval::is_increasing()

bool is_increasing() const noexcept

Whether t0 < t1.

Interval::is_singleton()

bool is_singleton() const noexcept

Whether t0 == t1.

Interval::swap()

Interval swap() const noexcept

The interval t1..t0.

Interval::grown()

Result<Interval> grown(double t) const

The increasing interval holding this one and t.

Interval::union_with()

Interval union_with(const Interval& o) const noexcept

The increasing interval holding this one and o.

union_with: union is a C++ keyword.

Interval::intersect()

std::optional<Interval> intersect(const Interval& o) const noexcept

The increasing overlap with o; std::nullopt where the two are apart. Two that touch give a singleton.

Interval::contains()

bool contains(double t) const noexcept

Whether t lies in the closed range, in either order.

Interval::parameter_at()

double parameter_at(double s) const noexcept

t0 + s (t1 - t0): the fraction s of the way from t0; outside 0..1 extrapolates.

Interval::normalized_parameter_at()

std::optional<double> normalized_parameter_at(double t) const noexcept

The fraction of the way t lies from t0 toward t1; std::nullopt for a singleton.

Tolerances

using Tolerances = cadaclysm::Tolerances

What a solid declares about its own precision, as a named tuple: absolute, a length in the model's own units, and angular, in radians — each none where nothing declared it. What Solid::tolerances() returns.

CurveFoot

struct CurveFoot

The closest point of a curve value, as a named tuple: its parameter t, the point, and unique — false where several points lie equally near and point is a fixed pick among them (a point on a circle's axis, one equidistant from an arc's ends).

SurfaceFoot

struct SurfaceFoot

The closest point of a surface value, as a named tuple: its parameters u, v, the point, and unique — false where several points lie equally near and point is a fixed pick among them (a sphere's centre, a point on an axis).

Line

class Line final : public CurveValueBase

The segment from start to end, as a value: a piece of construction geometry to measure, to project onto and to map, without building a solid. Its parameter runs 0..1. Immutable, with nothing to free: equal by value, hashable, iterating as its numbers, the maths the library's own, so every language answers alike. A frame argument is a Frame or 12 numbers; one within 1e-6 of right-handed and orthonormal is squared up, any other returns an Error in its Result, as does a size that is not positive and finite.

Line::start()

Vec3 start() const noexcept
Vec3 end() const noexcept

The two ends.

CurveValueBase::point_at()

Result<Vec3> point_at(double t) const

The point at t: the fraction t of the way from start to end (0..1 spans the segment).

CurveValueBase::tangent_at()

Result<Vec3> tangent_at(double t) const

The unit tangent at t, the way t grows.

CurveValueBase::length()

Result<double> length() const

The length.

CurveValueBase::closest_point()

Result<CurveFoot> closest_point(const Vec3& p) const

The CurveFoot nearest p: its parameter t, the point and unique. Exact for every kind, in closed form rather than by iteration. unique is false where several points lie equally near and the answer is a fixed pick among them — a point on a circle's axis, one equidistant from an arc's two ends; true otherwise.

CurveValueBase::distance_to()

Result<double> distance_to(const Vec3& p) const

How far p lies from the curve: the distance to its closest_point.

CurveValueBase::to_nurbs()

Result<NurbsCurve> to_nurbs() const

The curve as its exact NurbsCurve (a conic as a rational quadratic).

GeometryValue::bounds()

Result<std::pair<Vec3, Vec3>> bounds() const

The exact world box, (min, max), from the closed form rather than from samples.

Line::transform()

Result<Line> transform(const Transform& t) const

This value under t (a Transform, or 16 numbers), a value of the same type. A line takes any map that keeps its ends apart and an ellipse any that keeps it an ellipse; every other value only a similarity — turn a circle into an Ellipse first for anything else. Any other map returns an Error in its Result.

Circle

class Circle final : public CurveValueBase

The circle of radius about the frame's origin in its x-y plane, running counter-clockwise about its z from its x, as a value. Curve's value gives an edge's circle. Immutable, with nothing to free: equal by value, hashable, iterating as its numbers, the maths the library's own, so every language answers alike. A frame argument is a Frame or 12 numbers; one within 1e-6 of right-handed and orthonormal is squared up, any other returns an Error in its Result, as does a size that is not positive and finite.

Circle::through()

static Result<Circle> through(const Vec3& a, const Vec3& b, const Vec3& c)

The circle through the points a, b and c: its x toward a, turning a, b, c counter-clockwise. Three points on one line returns an Error in its Result.

Circle::radius()

double radius() const noexcept

The radius.

CurveValueBase::point_at()

Result<Vec3> point_at(double t) const

The point at t: t the angle in radians from the frame's x toward its y.

CurveValueBase::tangent_at()

Result<Vec3> tangent_at(double t) const

The unit tangent at t, the way t grows.

CurveValueBase::length()

Result<double> length() const

The length.

CurveValueBase::closest_point()

Result<CurveFoot> closest_point(const Vec3& p) const

The CurveFoot nearest p: its parameter t, the point and unique. Exact for every kind, in closed form rather than by iteration. unique is false where several points lie equally near and the answer is a fixed pick among them — a point on a circle's axis, one equidistant from an arc's two ends; true otherwise.

CurveValueBase::distance_to()

Result<double> distance_to(const Vec3& p) const

How far p lies from the curve: the distance to its closest_point.

CurveValueBase::to_nurbs()

Result<NurbsCurve> to_nurbs() const

The curve as its exact NurbsCurve (a conic as a rational quadratic).

Circle::frame()

Frame frame() const noexcept

The Frame the value is placed on.

GeometryValue::bounds()

Result<std::pair<Vec3, Vec3>> bounds() const

The exact world box, (min, max), from the closed form rather than from samples.

Circle::transform()

Result<Circle> transform(const Transform& t) const

This value under t (a Transform, or 16 numbers), a value of the same type. A line takes any map that keeps its ends apart and an ellipse any that keeps it an ellipse; every other value only a similarity — turn a circle into an Ellipse first for anything else. Any other map returns an Error in its Result.

Arc

class Arc final : public CurveValueBase

The part of a circle over angle (an Interval or two numbers, increasing, by at most a full turn), as a value: the circle's frame and radius, its angles measured from the frame's x toward its y. Curve's value gives an edge's arc. Immutable, with nothing to free: equal by value, hashable, iterating as its numbers, the maths the library's own, so every language answers alike. A frame argument is a Frame or 12 numbers; one within 1e-6 of right-handed and orthonormal is squared up, any other returns an Error in its Result, as does a size that is not positive and finite.

Arc::through()

static Result<Arc> through(const Vec3& a, const Vec3& b, const Vec3& c)

The arc from a through b to c. Three points on one line returns an Error in its Result.

Arc::from_start_tangent_end()

static Result<Arc> from_start_tangent_end(const Vec3& a, const Vec3& tangent, const Vec3& c)

The arc leaving a along tangent and ending at c. A zero tangent, or a c on the tangent's line, returns an Error in its Result.

Arc::radius()

double radius() const noexcept

The radius.

Arc::angle()

Interval angle() const noexcept

The angle range, an Interval.

Arc::start()

Result<Vec3> start() const
Result<Vec3> end() const
Result<Vec3> mid() const

The points at the start, the end and halfway along.

CurveValueBase::point_at()

Result<Vec3> point_at(double t) const

The point at t: t the angle in radians from the frame's x toward its y.

CurveValueBase::tangent_at()

Result<Vec3> tangent_at(double t) const

The unit tangent at t, the way t grows.

CurveValueBase::length()

Result<double> length() const

The length.

CurveValueBase::closest_point()

Result<CurveFoot> closest_point(const Vec3& p) const

The CurveFoot nearest p: its parameter t, the point and unique. Exact for every kind, in closed form rather than by iteration. unique is false where several points lie equally near and the answer is a fixed pick among them — a point on a circle's axis, one equidistant from an arc's two ends; true otherwise.

CurveValueBase::distance_to()

Result<double> distance_to(const Vec3& p) const

How far p lies from the curve: the distance to its closest_point.

CurveValueBase::to_nurbs()

Result<NurbsCurve> to_nurbs() const

The curve as its exact NurbsCurve (a conic as a rational quadratic).

Arc::frame()

Frame frame() const noexcept

The Frame the value is placed on.

GeometryValue::bounds()

Result<std::pair<Vec3, Vec3>> bounds() const

The exact world box, (min, max), from the closed form rather than from samples.

Arc::transform()

Result<Arc> transform(const Transform& t) const

This value under t (a Transform, or 16 numbers), a value of the same type. A line takes any map that keeps its ends apart and an ellipse any that keeps it an ellipse; every other value only a similarity — turn a circle into an Ellipse first for anything else. Any other map returns an Error in its Result.

Ellipse

class Ellipse final : public CurveValueBase

The ellipse of radius r1 along the frame's x and r2 along its y, as a value. Unlike a circle it takes any affine map that keeps it an ellipse. Curve's value gives an edge's whole ellipse (an elliptical arc's range stays on the Curve). Immutable, with nothing to free: equal by value, hashable, iterating as its numbers, the maths the library's own, so every language answers alike. A frame argument is a Frame or 12 numbers; one within 1e-6 of right-handed and orthonormal is squared up, any other returns an Error in its Result, as does a size that is not positive and finite.

Ellipse::from_circle()

static Result<Ellipse> from_circle(const Circle& circle)

circle as an ellipse of two equal radii, to map by a non-uniform scale or a shear.

Ellipse::r1()

double r1() const noexcept
double r2() const noexcept

The radii along the frame's x and y.

CurveValueBase::point_at()

Result<Vec3> point_at(double t) const

The point at t: t the eccentric angle in radians, from the frame's x toward its y.

CurveValueBase::tangent_at()

Result<Vec3> tangent_at(double t) const

The unit tangent at t, the way t grows.

CurveValueBase::length()

Result<double> length() const

The perimeter, in closed form.

CurveValueBase::closest_point()

Result<CurveFoot> closest_point(const Vec3& p) const

The CurveFoot nearest p: its parameter t, the point and unique. Exact for every kind, in closed form rather than by iteration. unique is false where several points lie equally near and the answer is a fixed pick among them — a point on a circle's axis, one equidistant from an arc's two ends; true otherwise.

CurveValueBase::distance_to()

Result<double> distance_to(const Vec3& p) const

How far p lies from the curve: the distance to its closest_point.

CurveValueBase::to_nurbs()

Result<NurbsCurve> to_nurbs() const

The curve as its exact NurbsCurve (a conic as a rational quadratic).

Ellipse::frame()

Frame frame() const noexcept

The Frame the value is placed on.

GeometryValue::bounds()

Result<std::pair<Vec3, Vec3>> bounds() const

The exact world box, (min, max), from the closed form rather than from samples.

Ellipse::transform()

Result<Ellipse> transform(const Transform& t) const

This value under t (a Transform, or 16 numbers), a value of the same type. A line takes any map that keeps its ends apart and an ellipse any that keeps it an ellipse; every other value only a similarity — turn a circle into an Ellipse first for anything else. Any other map returns an Error in its Result.

Sphere

class Sphere final : public SurfaceValue

The sphere of radius about the frame's origin, as a value: u the longitude from the frame's x, v the latitude toward its z. Measure it, project onto it, test points against it, or make it a solid with to_solid. Immutable, with nothing to free: equal by value, hashable, iterating as its numbers, the maths the library's own, so every language answers alike. A frame argument is a Frame or 12 numbers; one within 1e-6 of right-handed and orthonormal is squared up, any other returns an Error in its Result, as does a size that is not positive and finite.

Sphere::radius()

double radius() const noexcept

The radius.

SurfaceValue::point_at()

Result<Vec3> point_at(double u, double v) const

The point at (u, v), in the ranges domain gives.

SurfaceValue::normal_at()

Result<Vec3> normal_at(double u, double v) const

The outward unit normal at (u, v).

SurfaceValue::closest_point()

Result<SurfaceFoot> closest_point(const Vec3& p) const

The SurfaceFoot nearest p on the surface (a cylinder's and a cone's side, not their caps): its u, v, the point and unique. Exact for every kind, in closed form. unique is false where several points lie equally near and the answer is a fixed pick among them — a sphere's centre, a point on a cylinder's, cone's or torus's axis; true otherwise.

SurfaceValue::distance_to()

Result<double> distance_to(const Vec3& p) const

How far p lies from the surface: the distance to its closest_point.

SurfaceValue::domain()

Result<std::pair<Interval, Interval>> domain() const

The u and v ranges, as two Intervals.

SurfaceValue::to_nurbs_sheet()

Result<Solid> to_nurbs_sheet() const

The surface alone, as an open sheet on its exact NURBS form.

SolidValue::contains()

Result<bool> contains(const Vec3& p, double tolerance = 1e-9) const

Whether p lies inside the closed shape or within tolerance of it (1e-9 by default).

SolidValue::area()

Result<double> area() const

The boundary's area, in closed form: a cylinder's and a cone's caps included.

SolidValue::volume()

Result<double> volume() const

The volume enclosed, in closed form.

SolidValue::to_solid()

Result<Solid> to_solid() const

The shape as a closed exact B-rep Solid, to join, cut and write.

SolidValue::frame()

Frame frame() const noexcept

The Frame the value is placed on.

GeometryValue::bounds()

Result<std::pair<Vec3, Vec3>> bounds() const

The exact world box, (min, max), from the closed form rather than from samples.

Sphere::transform()

Result<Sphere> transform(const Transform& t) const

This value under t (a Transform, or 16 numbers), a value of the same type. A line takes any map that keeps its ends apart and an ellipse any that keeps it an ellipse; every other value only a similarity — turn a circle into an Ellipse first for anything else. Any other map returns an Error in its Result.

Cylinder

class Cylinder final : public SurfaceValue

The capped cylinder of radius about the frame's z over height (an increasing Interval along z, or two numbers), as a value: u the angle from the frame's x, v the height. Immutable, with nothing to free: equal by value, hashable, iterating as its numbers, the maths the library's own, so every language answers alike. A frame argument is a Frame or 12 numbers; one within 1e-6 of right-handed and orthonormal is squared up, any other returns an Error in its Result, as does a size that is not positive and finite.

Cylinder::radius()

double radius() const noexcept

The radius.

Cylinder::height()

Interval height() const noexcept

The range along the frame's z, an Interval.

SurfaceValue::point_at()

Result<Vec3> point_at(double u, double v) const

The point at (u, v), in the ranges domain gives.

SurfaceValue::normal_at()

Result<Vec3> normal_at(double u, double v) const

The outward unit normal at (u, v).

SurfaceValue::closest_point()

Result<SurfaceFoot> closest_point(const Vec3& p) const

The SurfaceFoot nearest p on the surface (a cylinder's and a cone's side, not their caps): its u, v, the point and unique. Exact for every kind, in closed form. unique is false where several points lie equally near and the answer is a fixed pick among them — a sphere's centre, a point on a cylinder's, cone's or torus's axis; true otherwise.

SurfaceValue::distance_to()

Result<double> distance_to(const Vec3& p) const

How far p lies from the surface: the distance to its closest_point.

SurfaceValue::domain()

Result<std::pair<Interval, Interval>> domain() const

The u and v ranges, as two Intervals.

SurfaceValue::to_nurbs_sheet()

Result<Solid> to_nurbs_sheet() const

The surface alone, as an open sheet on its exact NURBS form.

SolidValue::contains()

Result<bool> contains(const Vec3& p, double tolerance = 1e-9) const

Whether p lies inside the closed shape or within tolerance of it (1e-9 by default).

SolidValue::area()

Result<double> area() const

The boundary's area, in closed form: a cylinder's and a cone's caps included.

SolidValue::volume()

Result<double> volume() const

The volume enclosed, in closed form.

SolidValue::to_solid()

Result<Solid> to_solid() const

The shape as a closed exact B-rep Solid, to join, cut and write.

SolidValue::frame()

Frame frame() const noexcept

The Frame the value is placed on.

GeometryValue::bounds()

Result<std::pair<Vec3, Vec3>> bounds() const

The exact world box, (min, max), from the closed form rather than from samples.

Cylinder::transform()

Result<Cylinder> transform(const Transform& t) const

This value under t (a Transform, or 16 numbers), a value of the same type. A line takes any map that keeps its ends apart and an ellipse any that keeps it an ellipse; every other value only a similarity — turn a circle into an Ellipse first for anything else. Any other map returns an Error in its Result.

Cone

class Cone final : public SurfaceValue

The capped cone of base radius on the frame's x-y plane, its apex height up its z, as a value: u the angle from the frame's x, v the height. Immutable, with nothing to free: equal by value, hashable, iterating as its numbers, the maths the library's own, so every language answers alike. A frame argument is a Frame or 12 numbers; one within 1e-6 of right-handed and orthonormal is squared up, any other returns an Error in its Result, as does a size that is not positive and finite.

Cone::radius()

double radius() const noexcept

The base radius.

Cone::height()

double height() const noexcept

How far up the frame's z the apex lies.

SurfaceValue::point_at()

Result<Vec3> point_at(double u, double v) const

The point at (u, v), in the ranges domain gives.

SurfaceValue::normal_at()

Result<Vec3> normal_at(double u, double v) const

The outward unit normal at (u, v).

SurfaceValue::closest_point()

Result<SurfaceFoot> closest_point(const Vec3& p) const

The SurfaceFoot nearest p on the surface (a cylinder's and a cone's side, not their caps): its u, v, the point and unique. Exact for every kind, in closed form. unique is false where several points lie equally near and the answer is a fixed pick among them — a sphere's centre, a point on a cylinder's, cone's or torus's axis; true otherwise.

SurfaceValue::distance_to()

Result<double> distance_to(const Vec3& p) const

How far p lies from the surface: the distance to its closest_point.

SurfaceValue::domain()

Result<std::pair<Interval, Interval>> domain() const

The u and v ranges, as two Intervals.

SurfaceValue::to_nurbs_sheet()

Result<Solid> to_nurbs_sheet() const

The surface alone, as an open sheet on its exact NURBS form.

SolidValue::contains()

Result<bool> contains(const Vec3& p, double tolerance = 1e-9) const

Whether p lies inside the closed shape or within tolerance of it (1e-9 by default).

SolidValue::area()

Result<double> area() const

The boundary's area, in closed form: a cylinder's and a cone's caps included.

SolidValue::volume()

Result<double> volume() const

The volume enclosed, in closed form.

SolidValue::to_solid()

Result<Solid> to_solid() const

The shape as a closed exact B-rep Solid, to join, cut and write.

SolidValue::frame()

Frame frame() const noexcept

The Frame the value is placed on.

GeometryValue::bounds()

Result<std::pair<Vec3, Vec3>> bounds() const

The exact world box, (min, max), from the closed form rather than from samples.

Cone::transform()

Result<Cone> transform(const Transform& t) const

This value under t (a Transform, or 16 numbers), a value of the same type. A line takes any map that keeps its ends apart and an ellipse any that keeps it an ellipse; every other value only a similarity — turn a circle into an Ellipse first for anything else. Any other map returns an Error in its Result.

Torus

class Torus final : public SurfaceValue

The torus of major radius about the frame's z and minor radius about that circle, as a value: u the angle about the z from the frame's x, v the angle about the tube. Immutable, with nothing to free: equal by value, hashable, iterating as its numbers, the maths the library's own, so every language answers alike. A frame argument is a Frame or 12 numbers; one within 1e-6 of right-handed and orthonormal is squared up, any other returns an Error in its Result, as does a size that is not positive and finite.

Torus::major()

double major() const noexcept
double minor() const noexcept

The radius of the tube's centre circle, and the tube's own.

SurfaceValue::point_at()

Result<Vec3> point_at(double u, double v) const

The point at (u, v), in the ranges domain gives.

SurfaceValue::normal_at()

Result<Vec3> normal_at(double u, double v) const

The outward unit normal at (u, v).

SurfaceValue::closest_point()

Result<SurfaceFoot> closest_point(const Vec3& p) const

The SurfaceFoot nearest p on the surface (a cylinder's and a cone's side, not their caps): its u, v, the point and unique. Exact for every kind, in closed form. unique is false where several points lie equally near and the answer is a fixed pick among them — a sphere's centre, a point on a cylinder's, cone's or torus's axis; true otherwise.

SurfaceValue::distance_to()

Result<double> distance_to(const Vec3& p) const

How far p lies from the surface: the distance to its closest_point.

SurfaceValue::domain()

Result<std::pair<Interval, Interval>> domain() const

The u and v ranges, as two Intervals.

SurfaceValue::to_nurbs_sheet()

Result<Solid> to_nurbs_sheet() const

The surface alone, as an open sheet on its exact NURBS form.

SolidValue::contains()

Result<bool> contains(const Vec3& p, double tolerance = 1e-9) const

Whether p lies inside the closed shape or within tolerance of it (1e-9 by default).

SolidValue::area()

Result<double> area() const

The boundary's area, in closed form: a cylinder's and a cone's caps included.

SolidValue::volume()

Result<double> volume() const

The volume enclosed, in closed form.

SolidValue::to_solid()

Result<Solid> to_solid() const

The shape as a closed exact B-rep Solid, to join, cut and write.

SolidValue::frame()

Frame frame() const noexcept

The Frame the value is placed on.

GeometryValue::bounds()

Result<std::pair<Vec3, Vec3>> bounds() const

The exact world box, (min, max), from the closed form rather than from samples.

Torus::transform()

Result<Torus> transform(const Transform& t) const

This value under t (a Transform, or 16 numbers), a value of the same type. A line takes any map that keeps its ends apart and an ellipse any that keeps it an ellipse; every other value only a similarity — turn a circle into an Ellipse first for anything else. Any other map returns an Error in its Result.

Cuboid

class Cuboid final : public SolidValue

The box over x, y, z (increasing Intervals, or pairs) along its frame's axes, as a value: an oriented bounding box, a region to test points against, a block to make a solid of. Immutable, with nothing to free: equal by value, hashable, iterating as its numbers, the maths the library's own, so every language answers alike. A frame argument is a Frame or 12 numbers; one within 1e-6 of right-handed and orthonormal is squared up, any other returns an Error in its Result, as does a size that is not positive and finite.

Cuboid::from_bounds()

static Result<Cuboid> from_bounds(const Vec3& lo, const Vec3& hi)

The world-aligned box from min to max; an empty or flat one returns an Error in its Result.

Cuboid::around()

static Result<Cuboid> around(const FrameLike& frame, const std::vector<Vec3>& points)

The tightest box holding points, aligned to frame. No points, or points flat along one of the frame's axes (a sheet, not a box), returns an Error in its Result.

Cuboid::x()

Interval x() const noexcept
Interval y() const noexcept
Interval z() const noexcept

The three ranges along the frame's axes, as Intervals.

Cuboid::corners()

Result<std::array<Vec3, 8>> corners() const

The eight corners: the z0 face counter-clockwise about the frame's z from (x0, y0), then the z1 face in the same order.

Cuboid::point_at()

Result<Vec3> point_at(double sx, double sy, double sz) const

The point the fractions sx, sy, sz of the way along each range.

Cuboid::closest_point()

Result<Vec3> closest_point(const Vec3& p) const

The closest point of the solid box to p: p itself where it lies inside.

SolidValue::contains()

Result<bool> contains(const Vec3& p, double tolerance = 1e-9) const

Whether p lies inside the closed shape or within tolerance of it (1e-9 by default).

SolidValue::area()

Result<double> area() const

The boundary's area, in closed form: a cylinder's and a cone's caps included.

SolidValue::volume()

Result<double> volume() const

The volume enclosed, in closed form.

SolidValue::to_solid()

Result<Solid> to_solid() const

The shape as a closed exact B-rep Solid, to join, cut and write.

SolidValue::frame()

Frame frame() const noexcept

The Frame the value is placed on.

GeometryValue::bounds()

Result<std::pair<Vec3, Vec3>> bounds() const

The exact world box, (min, max), from the closed form rather than from samples.

Cuboid::transform()

Result<Cuboid> transform(const Transform& t) const

This value under t (a Transform, or 16 numbers), a value of the same type. A line takes any map that keeps its ends apart and an ellipse any that keeps it an ellipse; every other value only a similarity — turn a circle into an Ellipse first for anything else. Any other map returns an Error in its Result.

Rectangle

class Rectangle final : public CurveValueBase

The rectangle over x and y (increasing Intervals, or pairs) in its frame's x-y plane, as a value — Rhino's Rectangle3d. As a curve it is its boundary: t runs 0..4, one unit a side, from corner (x0, y0) counter-clockwise about the frame's z. Immutable, with nothing to free: equal by value, hashable, iterating as its numbers, the maths the library's own, so every language answers alike. A frame argument is a Frame or 12 numbers; one within 1e-6 of right-handed and orthonormal is squared up, any other returns an Error in its Result, as does a size that is not positive and finite.

Rectangle::x()

Interval x() const noexcept
Interval y() const noexcept

The two ranges along the frame's x and y, as Intervals.

Rectangle::frame()

Frame frame() const noexcept

The Frame the rectangle lies on.

Rectangle::corners()

Result<std::array<Vec3, 4>> corners() const

The four corners in Rhino's Corner(i) order: (x0, y0), (x1, y0), (x1, y1), (x0, y1).

Rectangle::area()

Result<double> area() const

The filled rectangle's area.

CurveValueBase::point_at()

Result<Vec3> point_at(double t) const

The boundary's point at t: side k for t in k..k+1. A t outside 0..4 is clamped, as Rhino's PointAt does, not wrapped.

CurveValueBase::tangent_at()

Result<Vec3> tangent_at(double t) const

The unit direction of t's side: the frame's x, y, -x, -y in turn.

CurveValueBase::length()

Result<double> length() const

The boundary's length, the circumference.

CurveValueBase::closest_point()

Result<CurveFoot> closest_point(const Vec3& p) const

The CurveFoot on the boundary nearest p (projected onto the plane first). unique is false where two sides lie equally near — the centre, any point on the medial axis — and the answer is a fixed pick among them.

CurveValueBase::distance_to()

Result<double> distance_to(const Vec3& p) const

How far p lies from the boundary.

Rectangle::closest_point_in()

Result<Vec3> closest_point_in(const Vec3& p, bool include_interior = true) const

Rhino's ClosestPoint(p, includeInterior): p projected onto the plane and clamped into the filled rectangle when include_interior (the default), else the boundary's closest point.

Rectangle::contains()

Result<std::string> contains(const Vec3& p, std::optional<double> tolerance = std::nullopt) const

Where p, projected onto the plane, lies: "inside", "outside", or "on" within tolerance of the boundary (Rhino's Contains). tolerance None (or NaN) is unset — the rectangle's own effective tolerance, tolerance.relative times its diagonal; 0 is exact, so only a point exactly on the boundary is on it. A negative or infinite one returns an Error in its Result.

Rectangle::to_sheet()

Result<Solid> to_sheet() const

The filled rectangle as a one-face planar sheet Solid, facing the frame's z.

CurveValueBase::to_nurbs()

Result<NurbsCurve> to_nurbs() const

The boundary as its exact closed degree-1 NurbsCurve, a knot at each corner, so its parameter is t.

GeometryValue::bounds()

Result<std::pair<Vec3, Vec3>> bounds() const

The world box of the four corners, (min, max).

Rectangle::transform()

Result<Rectangle> transform(const Transform& t) const

This rectangle under t (a Transform, or 16 numbers): any map that keeps its sides square — a similarity, a mirror, a stretch along its own axes. A shear in its plane, or a map that flattens it, returns an Error in its Result (Rhino's Transform answers a rectangle that is not the image).

Triangle

class Triangle final : public GeometryValue

The triangle a, b, c, as a value — Rhino's Triangle3d. Collinear or coincident points (an area at most 1e-12 of the longest side squared) returns an Error in its Result. Immutable, with nothing to free: equal by value, hashable, iterating as its numbers, the maths the library's own, so every language answers alike. A frame argument is a Frame or 12 numbers; one within 1e-6 of right-handed and orthonormal is squared up, any other returns an Error in its Result, as does a size that is not positive and finite.

Triangle::a()

Vec3 a() const noexcept
Vec3 b() const noexcept
Vec3 c() const noexcept

The three vertices.

Triangle::area()

Result<double> area() const

The area.

Triangle::perimeter()

Result<double> perimeter() const

The sum of the three sides.

Triangle::centroid()

Result<Vec3> centroid() const

The area centroid, the vertices' mean (Rhino's AreaCenter).

Triangle::circumcircle()

Result<Circle> circumcircle() const

The Circle through a, b and c: its x toward a, turning them counter-clockwise.

Triangle::point_at()

Result<Vec3> point_at(double wa, double wb, double wc) const

The point of barycentric weights wa, wb, wc, used as given (they need not sum to 1).

Triangle::barycentric()

Result<Vec3> barycentric(const Vec3& p) const

The weights (wa, wb, wc), summing to 1, of p projected onto the triangle's plane.

Triangle::closest_point()

Result<Vec3> closest_point(const Vec3& p) const

The closest point of the filled triangle to p, exact (by the vertex, edge and face regions, no iteration).

Triangle::distance_to()

Result<double> distance_to(const Vec3& p) const

How far p lies from the filled triangle.

Triangle::edge()

Result<Line> edge(std::uint32_t i) const

Edge i as a Line: 0 a to b, 1 b to c, 2 c to a. Any other i returns an Error in its Result.

Triangle::to_sheet()

Result<Solid> to_sheet() const

The filled triangle as a one-face planar sheet Solid, its normal turning a, b, c counter-clockwise.

GeometryValue::bounds()

Result<std::pair<Vec3, Vec3>> bounds() const

The world box of the three vertices, (min, max).

Triangle::transform()

Result<Triangle> transform(const Transform& t) const

This triangle under t (a Transform, or 16 numbers): any affine map, the vertices to their images. One that flattens it returns an Error in its Result.

Ray

class Ray final : public GeometryValue

The half-line from position along direction, as a value — Rhino's Ray3d. The direction is kept as given, not unitised, so t counts lengths of it; a zero one returns an Error in its Result. Shooting a ray at a solid is not here: see Solid::hits(). Immutable, with nothing to free: equal by value, hashable, iterating as its numbers, the maths the library's own, so every language answers alike. A frame argument is a Frame or 12 numbers; one within 1e-6 of right-handed and orthonormal is squared up, any other returns an Error in its Result, as does a size that is not positive and finite.

Ray::position()

Vec3 position() const noexcept
Vec3 direction() const noexcept

The start and the direction.

Ray::point_at()

Result<Vec3> point_at(double t) const

position + t * direction, for any t — behind the start too, as Rhino's PointAt.

Ray::closest_point()

Result<CurveFoot> closest_point(const Vec3& p) const

The CurveFoot on the ray nearest p: t clamped at 0, so a point behind the start answers the start. Always unique.

Ray::distance_to()

Result<double> distance_to(const Vec3& p) const

How far p lies from the ray.

GeometryValue::bounds()

Result<std::pair<Vec3, Vec3>> bounds() const

A ray has no box: this returns an Error in its Result.

Ray::transform()

Result<Ray> transform(const Transform& t) const

This ray under t (a Transform, or 16 numbers): any affine map, the position as a point and the direction as a vector. One that kills the direction returns an Error in its Result.

Workplane

class Workplane

The fluent chain: a frame, the solid built so far, and the face last picked. A build step replaces the solid rather than adding to it — combine solids explicitly with Solid::join(). Every step returns the Workplane and keeps the first refused step's error instead of failing at once: the steps after it are skipped, and solid() returns that error.

Workplane::xy()

static Workplane xy()

Start on the XY plane at the origin (Z up). Workplane::xz() and Workplane::yz() start on the other two.

Workplane::xz()

static Workplane xz()

Start on the XZ plane.

Workplane::yz()

static Workplane yz()

Start on the YZ plane.

Workplane::on()

static Workplane on(const Frame& f)

Start on any frame (see Frames).

Workplane::from_solid()

static Workplane from_solid(const Solid& source)

Start from an existing solid, on the XY plane — the usual way to pick one of its faces and build on it.

Workplane::frame()

Frame frame() const

The current frame, 12 numbers.

Workplane::cuboid()

Workplane& cuboid(double x, double y, double z) &

A box x × y × z centred on the current frame's origin and aligned to its axes — on a picked face, half of it below the face; replaces the solid.

Workplane::cylinder()

Workplane& cylinder(double r, double height) &

A cylinder of radius r and height h standing on the current frame; replaces the solid.

Workplane::face()

Workplane& face(const Profile& profile) &

The planar sheet the profile bounds on this frame — see Solid::face(); replaces the solid.

Workplane::extrude()

Workplane& extrude(const Profile& profile, double height) &

The profile extruded height along the frame's z; replaces the solid.

Workplane::revolve()

Workplane& revolve(const Profile& profile, double angle) &

The profile revolved angle radians about the frame's y axis; replaces the solid.

Workplane::translate()

Workplane& translate(double dx, double dy, double dz) &

Slide the current solid. Keeps the face selection — a rigid move keeps every face's index.

Workplane::faces()

Workplane& faces(const Selector& selector) &

Pick a face of the current solid with a Selector.

Workplane::workplane()

Workplane& workplane() &

Move the frame onto the face last picked (outward normal as z), so the next step builds on it.

Workplane::solid()

Result<Solid> solid()

The solid built so far. On an empty chain it returns an Error in its Result.

Selector and Axis

class Selector

Which face to pick: the one furthest along an axis, furthest against it, the one facing a direction, or by index. Used by Workplane::faces() and Solid::select_face().

Selector::max()

static Selector (max)(Axis axis)

The face furthest along axis.

Selector::min()

static Selector (min)(Axis axis)

The face furthest against axis.

Selector::normal()

static Selector normal(const Vec3& direction)

The face whose outward normal is nearest direction (need not be unit).

Selector::index()

static Selector index(std::uint32_t i)

The face with this index.

Axis

enum class Axis : std::uint32_t
x
y
z

X, Y, Z: the axes Selector::max() and Selector::min() take.

Solid

class Solid

An exact B-rep solid (or an open sheet): planes, cylinders, cones, spheres, tori and NURBS, trimmed and joined, never approximated by triangles. Immutable — every operation returns a new one. Close it when done, or let the language's scope do it; see Lifetimes.

Primitives

Solid::cuboid()

static Result<Solid> cuboid(double x, double y, double z)

A box x × y × z, centred on the origin.

Solid::cylinder()

static Result<Solid> cylinder(double r, double h)

A cylinder of radius r, from z = 0 to h.

Solid::cone()

static Result<Solid> cone(double r, double h)

A cone of base radius r and height h, apex up.

Solid::sphere()

static Result<Solid> sphere(double r)

A sphere of radius r about the origin.

Solid::torus()

static Result<Solid> torus(double major, double minor)

A torus about the z axis: major to the tube's centre, minor the tube's radius. A tube wider than its ring (minor > major, a spindle) builds the solid it sweeps, the outer sheet with a pole at each end on the axis; minor == major is refused.

Solid::wedge()

static Result<Solid> wedge(double x, double y, double z, double top_x)

A box whose top face is top_x long instead of x: a ramp.

Solid::pyramid()

static Result<Solid> pyramid(std::uint32_t sides, double r, double h)

A pyramid of sides sides (at least 3): its base the regular polygon of radius r on z = 0 (r to a corner, the first on +x), its tip at height h.

From a profile

Solid::extrude()

static Result<Solid> extrude(const Profile& profile, const Frame& frame, double height)

The profile on frame, extruded height along the frame's z.

Solid::extrude_open()

static Result<Solid> extrude_open(const Profile& profile, const Frame& frame, double height)

The walls only, no caps: an open sheet. Takes an open Path::end_open() chain as well as a closed profile.

Solid::extrude_tapered()

static Result<Solid> extrude_tapered(const Profile& profile, const Frame& frame, double height, double taper)

Extrude with a draft: the walls lean out by taper radians as they rise (in, when negative). Every wall stays exact — a plane off a line, a cone off an arc.

Solid::extrude_open_tapered()

static Result<Solid> extrude_open_tapered(const Profile& profile, const Frame& frame, double height, double taper)

The tapered walls without caps.

Solid::extrude_between()

static Result<Solid> extrude_between(const Profile& profile, const Frame& frame, const Slant& bottom, const Slant& top)

Extrude between two planes rather than two heights: bottom and top are each a Slant (a bare number is a flat one). With both flat this is Solid::extrude(); with a slope it is the mitred end of a frame member. A top that comes down to or through the bottom returns an Error in its Result.

Solid::extrude_open_between()

static Result<Solid> extrude_open_between(const Profile& profile, const Frame& frame, const Slant& bottom, const Slant& top)

Solid::extrude_between() without the caps.

Solid::revolve()

static Result<Solid> revolve(const Profile& profile, const AxisLine& axis, double angle)

The profile swung angle radians about axis (a point and a direction — see Frames). The profile's x is read as the radius and its y as the height along the axis, so it must lie to one side of it.

Solid::revolve_open()

static Result<Solid> revolve_open(const Profile& profile, const AxisLine& axis, double angle)

The revolved surface of an open profile: a sheet.

Solid::revolve_in_plane()

static Result<Solid> revolve_in_plane(const Profile& profile, const Frame& frame, const Vec2& a, const Vec2& b, double angle)

The profile on frame swung angle radians about the axis through the sketch points a and b (each (x, y) on the frame) — the profile and its axis drawn together, as a sketch draws them, where Solid::revolve() reads the profile as (radius, height). The profile may lie on either side of the axis and touch it (a half-disc with its diameter on the axis turns into a ball), but not cross it. The sweep starts where the profile is drawn and turns right-handed about b - a, so a partial turn leaves one end of the solid over the profile itself.

Solid::revolve_open_in_plane()

static Result<Solid> revolve_open_in_plane(const Profile& profile, const Frame& frame, const Vec2& a, const Vec2& b, double angle)

Solid::revolve_in_plane() for a curve: its segments swung into a sheet, no caps.

Solid::coil()

static Result<Solid> coil(const Profile& profile, const AxisLine& axis, double pitch, double turns)

The profile coiled about axis (a point and a direction): read as Solid::revolve() reads it — x the distance from the axis, y along it — and turned turns times while climbing pitch along the axis each turn: a spring, a thread. The walls follow the helix to a few millionths of the radius (a helix is not a NURBS curve, so they are a close fit, exact at both ends); the two ends are the profile itself, flat. A profile reaching the axis, one with holes, or — from a full turn up — a pitch no taller than the profile returns an Error in its Result.

Solid::loft()

static Result<Solid> loft(const Profile& a, const Frame& frame_a, const Profile& b, const Frame& frame_b)

The solid between profile a on one frame and b on another: ruled walls between matching sides (both profiles need the same number of sides, and no holes), capped by the two.

Solid::loft_open()

static Result<Solid> loft_open(const Profile& a, const Frame& frame_a, const Profile& b, const Frame& frame_b)

The ruled walls without the caps.

Solid::loft_through()

static Result<Solid> loft_through(const Sections& sections)

The solid smooth through every section — a profile on its frame, in order: each wall interpolates its side across all the profiles (cubic through four or more, quadratic through three, Solid::loft() through two), capped by the first and the last. Every section of the result is its profile exactly, arcs and all. The profiles must have the same number of sides and no holes; otherwise returns an Error in its Result.

Sections is a std::vector of Sections, each a {profile, frame} pair, both borrowed for the call.

Solid::loft_through_open()

static Result<Solid> loft_through_open(const Sections& sections)

The walls through the curves without the caps: an open sheet.

Solid::sweep()

static Result<Solid> sweep(const Profile& profile, const Frame& frame, const SweepPath& path)

The profile on frame, carried along a SweepPath. A straight piece is an extrusion and an arc a revolution about the arc's axis, so nothing is approximated — a circle along an arc is an exact torus wall.

Solid::sweep_open()

static Result<Solid> sweep_open(const Profile& profile, const Frame& frame, const SweepPath& path)

The swept walls without caps: an open sheet.

Solid::pipe()

static Result<Solid> pipe(const SweepPath& path, double radius, double thickness = 0.0)

A circle of radius carried along a SweepPath, square to where it starts: a solid rod, or with a positive thickness a tube whose walls are that thick. The path is only borrowed, as by Solid::sweep(), and refused the same way.

Solid::extrude_faces()

Result<Solid> extrude_faces(double height) const

Every face of a sheet pushed height along its own normal, walled and closed: the sheet as a solid of that thickness.

Solid::face()

static Result<Solid> face(const Profile& profile, const Frame& frame)

The flat sheet a profile bounds on frame: one planar face, each hole a hole through it, its normal the frame's z however the profile winds, every edge the exact line, arc or spline its segment is. An open sheet — raise it with Solid::extrude_faces(), cut it with Solid::trim().

Placing

Solid::place()

Result<Solid> place(const Frame& frame) const

A solid built about the origin moved onto frame: its origin to the frame's origin, its axes to the frame's (see Frames).

Solid::translate()

Result<Solid> translate(double dx, double dy, double dz) const

Moved by (dx, dy, dz).

Solid::scale()

Result<Solid> scale(double factor) const

Scaled by factor about the origin: every length times factor, exactly. factor must be positive and finite.

Solid::rotate()

Result<Solid> rotate(const AxisLine& axis, double radians) const

Turned radians about axis (a point and a direction).

Solid::mirror()

Result<Solid> mirror(const Frame& plane) const

Reflected across plane: a frame whose z is the mirror plane's normal.

Solid::transform()

Result<Solid> transform(const Transform& t) const
Result<Solid> transform(const std::array<double, 16>& matrix) const

Through the affine map t — a Transform, or 16 numbers row-major — exactly, colours and name kept. A rigid map or a similarity keeps every surface's kind; a map within 1e-6 of a similarity (AᵀA against k²I, relative to k²: a rotation written in float32 among them) is applied as the exact similarity nearest it, moving a point p by at most about 1e-6·|A|·|p|. Any other map — a non-uniform scale, a shear — turns the curved surfaces into their exact NURBS and maps those. A singular map returns an Error in its Result.

Solid::convert_to_nurbs()

Result<Solid> convert_to_nurbs(NurbsLevel level = NurbsLevel::all) const

Every surface level selects rewritten as its exact NURBS: "procedural" the revolutions, extrusions and sums; "analytic" those and the cylinders, cones, spheres and tori; "all" everything, planes and edge curves too. Colours and name kept.

Solid::inexact_trims()

std::uint32_t inexact_trims() const noexcept

On a solid from Solid::transform() or Solid::convert_to_nurbs(), the trims that call lost: face boundaries kept only as a polyline lifted through the old surface, where no exact edge curve was left. Per call — not the solid's history — and 0 for a rigid map or a similarity, and on every other solid.

Booleans

Solid::join()

Result<Solid> join(const Solid& other, std::optional<double> tolerance = DEFAULT_TOLERANCE, const Progress& progress = {}, bool merge = false) const

The union with other, as an exact B-rep. merge (off by default, so face and edge numbers stay as they were) merges the flush faces the join leaves, as Solid::merge_flush() does — Go takes it as a trailing true, Java as an overload; Solid::cut() and Solid::common() take it too. tolerance (0.05 by default) is the mesh tolerance the boolean decides at: both solids are meshed at it, so a tighter one is as correct and slower. It is also the resolution: two faces on one surface to within it — a peg the size of its hole, or a hair thinner — are one surface, and the join is a fit; a gap wider than it is a gap. progress, where the wrapper takes one, is called with a phase name and a done/total count.

merge and progress are the last two arguments; progress is a std::function<void(std::string_view, std::size_t, std::size_t)>.

Solid::cut()

Result<Solid> cut(const Solid& other, std::optional<double> tolerance = DEFAULT_TOLERANCE, const Progress& progress = {}, bool merge = false) const

This solid with other removed.

Solid::common()

Result<Solid> common(const Solid& other, std::optional<double> tolerance = DEFAULT_TOLERANCE, const Progress& progress = {}, bool merge = false) const

What this solid and other share.

Solid::intersect()

Result<Intersection> intersect(const Solid& other, std::optional<double> tolerance = DEFAULT_TOLERANCE, const Progress& progress = {}) const

Where this solid's faces cross or coincide with other's, at tolerance, as an Intersection: every crossing as a Chain, every coincident face pair that shares a region as an Overlap. Not a boolean: neither solid changes, nothing is built. tolerance (0.05 by default) is read as Solid::join()'s — both solids' mesh resolution and how close a point may sit to both faces' exact surfaces to be reported. No crossing at all is an empty Intersection, never an error. progress, where the wrapper takes one, is called with a phase and a done/total count: meet on the exact route; mesh, cull, cross, snap, curve where it falls back to the mesh route. The exact route takes planes, cylinders, cones, spheres, tori and certified helical walls; a solid with a free-form face takes the mesh route, unless the option intersect.free_form_exact (cadaclysm::blacksmith::set_option()) asks for free-form faces too.

There is one chain per face pair per branch: a chain does not cross a face boundary or a closed curve's own seam, so a crossing that runs past either comes back as more than one chain, joined by matching ends. Two faces on one surface sharing no region — an edge or a rim resting against another face, two flush faces meeting along a line — are silent: neither a chain nor an overlap. Known limit: a crossing narrower than tolerance — two surfaces passing within it of each other without their meshes actually crossing — can be missed; where this bites the surfaces are near-tangent, and the chain that is found (if any) carries tangent.

Solid::self_intersections()

Result<Intersection> self_intersections(std::optional<double> tolerance = DEFAULT_TOLERANCE, const Progress& progress = {}) const

Where this solid passes through itself, at tolerance, as an Intersection — what Solid::intersect() reports with this solid on both sides, so every Chain and Overlap names two faces of this solid. Never along its own topology: faces meeting at the edges and vertices they share are not a crossing, so a clean solid is an empty Intersection, never an error. A chain whose two faces are one face is that face folding through itself, and has no curve. The solid is not changed; it may be an open sheet. tolerance (0.05 by default) is the mesh resolution, as Solid::intersect()'s: the solid is meshed once and crossed against itself, the exact face-pair engine refining each crossing of two faces, so the same known limit holds — a crossing narrower than tolerance can be missed. progress, where the wrapper takes one, hears mesh, cull, cross, snap, curve. A tolerance not positive and finite, a solid with no faces or one that meshes to nothing, returns an Error in its Result.

Solid::check()

Result<std::vector<Finding>> check(const Solid* other, std::optional<std::string_view> operation, std::optional<double> tolerance = DEFAULT_TOLERANCE, const Progress& progress = {}) const
Result<std::vector<Finding>> check(std::optional<double> tolerance = DEFAULT_TOLERANCE, const Progress& progress = {}) const

What is wrong with this solid (and other, if given) as the arguments of operation, at tolerance, as a list of Finding — OCCT's BRepAlgoAPI_Check, gathered from what the kernel already measures. An empty list is a valid pair; nothing is changed. Each argument is checked alone whatever the operation: no faces, features smaller than tolerance as Solid::health() finds them, shared edges whose sides part, edges that leave a face's surface, creases where the geometry is only C0, and where it passes through itself as Solid::self_intersections() finds it. operation — join, cut, common, split_sheet, trim, merge or intersect — adds what that verb refuses each argument for: a boolean wants both closed (one open finding per free edge) and holding no region wall (a merge's body); a split or trim only its tool closed; a merge closed manifolds of planes, cylinders, cones, spheres and tori. Without other, this solid is held to what the operation asks of its first argument. A free edge is no fault without an operation that asks for a closed solid: an open sheet is a fine body.

An edge leaves a face's surface (curve_on_surface) where its descriptions — its trim in the face's parameters carried onto the surface, its curve and its polyline in space — part from the surface, or from one another there, by more than tolerance (or the edge's own recorded tolerance, if larger); a polyline is measured at its points only, so a file's coarse flattening is no fault. A crease (c0_inside) is a line where the geometry turns a corner inside a face — a spline knot of full multiplicity, a kink in a swept surface's profile, every point of a profile a file flattened to a polyline — or along an edge's own curve, sharper than the angular tolerance: the solid's declared one, else the tolerance.angular option (one degree). A knot where the two sides meet tangent is no crease, unlike OCCT's check, which flags any C0 parametrisation. Both are sampled, so a deviation narrower than the sampling can be missed.

With other, the sub-shapes of the two a boolean would merge or struggle with come too, whatever the operation, each as a finding with argument 0, index in this solid and other in other: two vertices further apart than the weld (1e-6, inside which two points are one) but within tolerance (merge_vertex); two edges running along one another within tolerance and parallel within the angular tolerance over a stretch longer than tolerance, without being one edge (merge_edge); two faces lying on one another only within tolerance (merge_face); and two faces whose crossing runs where they are tangent within the angular tolerance — a cylinder lying on a block, which a join refuses as touching itself along a line (tangent_face). Vertices, edges and faces exactly on one another are what a boolean handles, and are none. The face findings are read off Solid::intersect()'s answer, so a point contact, which has no crossing, is not found, and a crossing shallower than the angular tolerance is a crossing. progress, where the wrapper takes one, hears health, curve_on_surface and continuity, then the self-intersection's phases, then — with other — pairs. An unknown operation or a tolerance not positive and finite, returns an Error in its Result.

Solid::section()

Result<std::vector<Profile>> section(double z, std::optional<double> tolerance = 0.05) const

This solid cut by the plane Z = z: its closed outlines there, in XY, nested into profiles with holes (boundaries counter-clockwise, holes clockwise), a line or a circle crossing kept exact and any other curve as lines within tolerance. A plane that misses the solid is an empty list. A z not finite, a tolerance (0.05 by default) not positive and finite, a face lying in the plane (section a little above or below it), or a crossing that does not close, returns an Error in its Result.

Solid::section_curves()

Result<std::vector<SectionCurve>> section_curves(const Vec3& origin, const Vec3& normal, std::optional<double> tolerance = std::nullopt) const

This body cut by the plane through origin square to normal, as curves in space, as Rhino's Intersection.BrepPlane: each a SectionCurve, each closed section loop one closed curve, an open sheet's crossing one open curve. A crossing on a line, circle, ellipse or NURBS is that curve exactly; any other a cubic fitted at tolerance (0 or std::nullopt the body's own; its error says how far). A face lying in the plane gives its own edges, exactly. A plane missing the body gives an empty list.

Solid::contour_curves()

Result<std::vector<SectionCurve>> contour_curves(const Vec3& start, const Vec3& end, double interval, std::optional<double> tolerance = std::nullopt) const

This body cut by the planes square to end - start through start and every interval on towards end, as Rhino's Brep.CreateContourCurves, as Solid::section_curves() cuts by one: every plane's SectionCurves in plane order, each one's plane its index. start and end the same point, an interval not positive and finite, or more than 10,000 planes, returns an Error in its Result.

Solid::hits()

Result<SolidHits> hits(const Profile& profile, const Frame& frame, std::optional<double> tolerance = DEFAULT_TOLERANCE, const Progress& progress = {}) const

Where profile, placed on frame, pierces this solid's faces, and the pieces its loops cut into, as a SolidHits. Neither is changed. A point hit lies within tolerance of the segment's exact curve and of the face's exact surface, inside the face's trim; its profile spot (Hit::a_start: loop, segment, t) and face spot (Hit::b_start: face, u, v) evaluate to the point within tolerance; touch where the curve's tangent lies within 1e-3 (sine) of the surface's tangent plane there (a graze), false at a crossing. A run is a stretch of one segment lying within tolerance of one face and inside it, longer than tolerance. Hits within tolerance of each other merge (a hit at a segment join reported once, as (k, t = 1); a closed loop's closing join reads (0, 0)). Every point is in world space (the frame applied).

Pieces (Piece) only for a closed body — an open body has none — in loop order, covering every loop exactly; a piece's spots read a segment join as the next segment's start (k + 1, 0), and an open chain runs from (0, 0) to (n - 1, 1); a loop no hit cuts is one closed piece. inside by the piece middle's winding number over the body's mesh; a piece lying on the surface is inside. Known limit: a segment passing within tolerance of a face without its polyline crossing the mesh can be missed (near-tangent grazes).

progress, where the wrapper takes one, is called with phases mesh, cull, hits and pieces and a done/total count. A tolerance not positive and finite, a solid with no faces or that meshes to nothing, a profile with no segments, or a free-form segment that is not an evaluable NURBS curve returns an Error in its Result.

Solid::split_sheet()

Result<Solid> split_sheet(const Solid& tool, std::optional<double> tolerance = DEFAULT_TOLERANCE, const Progress& progress = {}) const

This solid or sheet cut along tool's boundary with nothing removed: each face comes back as its pieces outside tool and then its pieces inside, in the original face order — the start of a surface trim. tool must be a closed solid. Keep the pieces you want with Solid::drop_faces(), or split and drop in one call with Solid::trim().

Faces and sheets

Solid::face_sheet()

Result<Solid> face_sheet(std::uint32_t f) const

One face alone, as an open sheet: its surface, its loops and the exact curves on its edges, the rest of the solid left behind — raised by Solid::extrude_faces() it is the prism over that face. Keeps the face's colour.

Solid::drop_faces()

Result<Solid> drop_faces(const std::vector<std::uint32_t>& which) const

This solid without the faces listed: the rest keep their surfaces, curves and colours in their order, so an index into the result is this one's with the dropped ones closed up. Dropping every face returns an Error in its Result.

Solid::split_faces()

Result<Solid> split_faces(const std::vector<NurbsCurve>& curves, const std::vector<std::optional<std::uint32_t>>& faces = {}, std::optional<double> tolerance = std::nullopt) const

This solid with its faces split along curves (NurbsCurves), in place: still one body — a closed solid stays closed, a sheet keeps its rim — with more faces, each new face a piece of a face of this one on its own surface and every new edge the curve itself, as OCCT's SplitShape. Nothing is cut away. Curve i is laid on face faces[i], which it must lie on, or — faces std::nullopt, or an entry std::nullopt — on every face it lies on, only where it does, so one curve can run over several faces. A curve may run past its face (what lies outside is dropped), cross other curves, and close on itself inside a face as an island; every stretch kept must end on the face's edges or on another curve's end. Exact on planes, cylinders, spheres and tori. Both pieces of a split face keep its colour and attributes; the first keeps its id, the others get new ids whose origin is the face. tolerance std::nullopt is the solid's effective tolerance. faces not as long as curves, no curves, a face this solid has not, a curve off its face, a stretch stopping inside a face, a curve through a pole of its face's surface (a sphere's pole, a cone's apex), or no curve crossing any face returns an Error in its Result.

Solid::split_along_silhouette()

Result<Solid> split_along_silhouette(const Vec3& direction, std::optional<double> tolerance = std::nullopt) const

This solid with its faces split along its silhouette seen along direction — a parallel view, looking along it: every face the outline runs across is cut there, into the part facing the view and the part facing away, still one body with more faces, as Fusion's silhouette split — a mould's parting line for a pull along direction. Exact on planes, cylinders, cones, spheres and tori where the view allows (a sphere splits on its equator, a cylinder seen side on along its two side lines), fitted within tolerance (std::nullopt: the solid's effective tolerance) elsewhere. Colours, ids and attributes as Solid::split_faces(). A zero or non-finite direction, an outline through a pole of a face's surface (a sphere seen across its axis, a cone seen side on), or an outline that crosses no face (a box seen along an axis) returns an Error in its Result.

Solid::trim()

Result<Solid> trim(const Solid& tool, Keep keep = Keep::outside, std::optional<double> tolerance = DEFAULT_TOLERANCE, const Progress& progress = {}) const

This sheet (or solid) cut along the closed tool's boundary and the pieces on one side thrown away: keep Keep::outside (the default) keeps what lies outside the tool — a hole punched through — and Keep::inside what lies within it. Nothing on the kept side returns an Error in its Result. tolerance and progress as for Solid::join().

keep is Keep::outside or Keep::inside.

Solid::split_by_curve()

Result<Solid> split_by_curve(const NurbsCurve& curve, const std::optional<Vec3>& direction = std::nullopt, std::optional<double> tolerance = 0.05) const

This sheet cut along curve — a NurbsCurve lying on it, typically projected or pulled onto it — with nothing removed: each face comes back as its pieces outside the cutter and then its pieces inside, as Solid::split_sheet() orders them. The cutter is the curve run along direction (std::nullopt: the mean of the sheet's normals along the curve) through the whole sheet, so the cut follows the curve wherever the sheet is one layer along that direction. A closed curve's inside is the island it bounds; an open curve's is the side left of its run, seen from where direction points, and an open curve is run on straight past both ends, so it should reach the sheet's boundary. Where the cut lies on the curve — a curve drawn on the sheet — the rim is one edge carrying the curve's own span exactly, its ends on the curve, so another sheet built along the same curve sews to it with Solid::join_sheets(). A direction that is zero, or a curve running along it, returns an Error in its Result.

Solid::trim_by_curve()

Result<Solid> trim_by_curve(const NurbsCurve& curve, const std::string& keep = "outside", const std::optional<Vec3>& direction = std::nullopt, std::optional<double> tolerance = 0.05) const

This sheet cut along curve and one side thrown away (see Solid::split_by_curve()): keep "outside" (the default) keeps the sheet with the hole a closed curve cuts, "inside" the island; for an open curve "left" (the same as "inside") keeps the side left of its run seen from where direction points, "right" the other. Nothing on the kept side returns an Error in its Result. The kept pieces keep their faces' colours.

Solid::flange()

Result<Solid> flange(const std::vector<std::uint32_t>& edges, const NurbsCurve& section, std::optional<double> tolerance = 1e-3, bool join = true) const

A section swept along each of edges — naked edges of this sheet, bordered by one face — on the face's own frame, the new sheets sewn to this one: at every point of the edge the section's x runs outward from the face (square to the edge, in its tangent plane) and its y along the face's normal, so a section from (0, 0) to (0, -10) turns the edge under by 10 all along it however the panel curves — a flange round an opening, a wheel arch's lip, a door-seal return — (0, 0) to (10, 0) carries the face on, and a lip stands proud with y > 0. section is a NurbsCurve in the plane z = 0 starting at the origin. With join false the sweeps come back alone, sewn to each other. Each is fitted within tolerance, and its side along the edge too; sheet_error says how close. An edge bordered by two faces, a section not starting at the origin, or sweeps that did not sew on returns an Error in its Result.

Solid::extrude_to()

Result<Solid> extrude_to(const std::vector<std::uint32_t>& edges, const Vec3& direction, const Solid& target, std::optional<double> tolerance = 1e-3, bool join = true) const

Each of edges — naked edges of this sheet — slid along direction until it meets target: every point of the edge travels along the direction to its first hit on target's faces (the trimmed faces, not their whole surfaces). One wall per edge, the edge's own curve swept straight and bounded by the curve through the hits, fitted within tolerance of every hit (sheet_error), so the wall shares the edge exactly and meets the target within the tolerance — a wheel arch cut in a panel run in to the well's inner wall as its liner. The walls come back sewn to this sheet, or alone with join false. A direction of no length, or a point whose line misses the target (named), returns an Error in its Result.

Solid::split_along_curve()

Result<Solid> split_along_curve(const NurbsCurve& curve, std::optional<double> tolerance = 0.01) const

This sheet cut along curve, a NurbsCurve lying on it (within ten times tolerance), with no direction: each face is cut in its own parameters where the curve crosses it, so the cut follows the curve however far the sheet rolls, and runs on across the seams of a joined sheet. An open curve is carried on along the sheet past both ends to its boundary; a closed one cuts out the island it bounds. Nothing is removed. Where the cut lies on the curve the rim is one edge carrying the curve's own span exactly. A curve that leaves the sheet returns an Error in its Result.

Solid::panel_gap()

Result<Panels> panel_gap(const NurbsCurve& curve, double gap = 4.0, double flange = -10.0, std::optional<double> tolerance = 0.01) const

This sheet parted along curve (lying on it, as for Solid::split_along_curve()) into two panels with a shut line between them — a car body's panel gap: each trimmed back gap / 2 from the curve, measured along the sheet, and given a flange flange along the faces' outward normals on the edge it was cut back to (negative turns it under; 0 for none). Only the cut edges are flanged, not the sheet's own edges, and each flange ends square where the curve runs off the sheet. The panel left of the curve's run (seen from the outward side) first, then the right one; a loop run counter-clockwise from that side has the island on its left. A curve that leaves the sheet, or a gap that leaves nothing of a panel, returns an Error in its Result.

Solid::join_sheets()

static Result<JoinedSheets> join_sheets(const Solids& sheets, std::optional<double> tolerance = 0.0)

Separate sheets joined into one body, their faces in order, beside a JoinReport of what was done: every two naked edges whose ends and curves agree within tolerance (0: a rounding of the body's size) sewn into one edge — a gap closed is kept as that edge's own tolerance, nothing moves — the faces turned to agree across their edges, and a closed result turned to face out: a solid Solid::cut(), Solid::mass() and the writers take like any other. Edges that carry exact curves are compared to the tolerance however coarsely each sheet sampled them. One sheet's edge running along part of another's is not sewn and stays naked. No sheets, a negative tolerance, or faces that cannot be turned to agree (a one-sided surface) returns an Error in its Result.

Solid::mirror_join()

Result<Mirrored> mirror_join(const Frame& plane, double snap = 0.0, std::optional<double> tolerance = 0.0) const

This half and its reflection across plane (a Frame, its z the plane's normal) joined into one symmetric body — half a car, a hull or a bottle modelled once and mirrored — the half's faces first, beside a SymmetryReport of how well the seam on the plane meets. With snap above 0, every NURBS face that is its whole surface and has a side whose control points all lie within snap of the plane is squared to it first: that side pulled onto the plane and the next row of control points stood straight off it along the plane's normal, keeping its distance from the plane. The surface then crosses the plane at 90 degrees, so it meets its mirror tangent and curvature continuous; nothing past that row moves, and neighbouring faces along the plane whose shared side agrees are squared alike and sew back. snap 0 mirrors the half as it is, a crease wherever it leans. The halves are sewn within tolerance (0: a rounding of the body's size). A half on both sides of the plane, no edge of it on the plane, or a face that cannot be squared (its next row on the plane or past it) returns an Error in its Result.

Solid::pattern()

Result<Patterned> pattern(const std::vector<Transform>& transforms, std::optional<double> tolerance = std::nullopt) const

This body and its copies at transforms (rigid Transforms, typically from Pattern, instance 0 the identity keeping the original) as one body — a pattern of bodies — beside a PatternReport. Copies apart from each other are put together with no boolean at all; copies that overlap are joined, one boolean a group. No transforms, or one that is neither rigid nor a mirror, returns an Error in its Result.

Solid::pattern_feature()

Result<Patterned> pattern_feature(const Solid& tool, FeatureOp op, const std::vector<Transform>& transforms, std::optional<double> tolerance = std::nullopt) const

tool — any closed solid, typically a _tool call's result — placed at each of transforms and applied to this body by op, "cut" or "join": a pattern of features, Fusion's compute type *identical*, beside a PatternReport. Copies apart from each other are one multi-lump tool and one boolean, however many there are; overlapping copies fall into a few groups. A copy that shares no volume with the body is missed: dropped for a cut, kept as a body of its own for a join. An unknown op, no transforms, one neither rigid nor a mirror, or a tool that is not closed returns an Error in its Result.

Solid::hole()

Result<Drilled> hole(const std::vector<Vec3>& points, double diameter, const HoleOptions& options = HoleOptions()) const

This body drilled at points — one point, or several: one hole each, all of one spec, in one cut — beside a HoleReport. The bore is an exact cylinder of diameter, a counterbore an exact cylinder, a countersink and a drill point exact cones. direction is the drilling direction, into the material, shared by every point; std::nullopt drills each point along the inward normal of the face it lies on (on an edge, the lowest-numbered face's).

extent: "through" everything ahead of the point; "blind", depth of full bore then a drill point of included angle tip_angle (0 or pi: a flat bottom); "to_face", until the axis first meets face face, the bore ending on it whatever its shape; "to_next", until the bore first leaves the material (OCCT's thru-next). head: std::nullopt, "counterbore" (head_diameter across, head_depth deep) or "countersink" (head_diameter across at the point, included angle head_angle), measured from the point. Angles in radians. An unknown choice, a diameter not positive, a depth or face its extent does not take, a head not wider than the bore, an angle out of range, a point not on a face with no direction, a hole that removes nothing, or a face the axis never meets returns an Error in its Result.

Tapped holes: thread (a designation or a ThreadSize) taps every hole. A diameter of 0 is then the tap drill (major - pitch), a given one must lie in the thread's internal band, and a head must be wider than the major. The thread starts at the point (a counterbore's floor) and runs thread_depth (std::nullopt: the bore's length). thread_modelled cuts it in one more boolean after the holes; false drills the bore alone and writes a cosmetic record on each hole's bore face (Solid::thread_record()). left_handed climbs the other way; the report's thread_depths has one per hole.

The keyword arguments are a HoleOptions, default-constructed to the defaults above.

Solid::hole_tool()

Result<Solid> hole_tool(const std::vector<Vec3>& points, double diameter, const HoleOptions& options = HoleOptions()) const

The tool Solid::hole() cuts with, from the same arguments: a closed solid, one lump a point — for Solid::pattern_feature() or a boolean of your own. A modelled thread's coils are joined into it (one more boolean, the tool's alone).

The keyword arguments are a HoleOptions, default-constructed to the defaults above.

Solid::thread()

Result<Threaded> thread(std::uint32_t face, const std::optional<std::string>& size = std::nullopt, const ThreadOptions& options = ThreadOptions()) const

This body with a screw thread cut into cylindrical face face — external on a rod, internal in a bore (the face's normal decides) — beside a ThreadReport. The cutter is one coil of the basic ISO 68-1 profile at angle (the included flank angle, radians; 60 degrees by default), cut in one boolean.

size is a designation ("M10", "m10 x 1.25", "1/4-20": cadaclysm::blacksmith::thread_size()'s forgiving lookup) or a ThreadSize; without one, pitch is required and diameter is the major (std::nullopt: the face's diameter on a rod, the face taken as the basic minor in a bore). The face must lie in the thread's band: external [D2, D + P/8], internal [D1 - P/8, D2]. The span runs along the axis from the face's open end (air past it: a rod's tip, a bore's mouth; else the end lower along the face cylinder's axis; reverse the other) after offset, for length (std::nullopt: the rest of the face). Where it ends at an open end the groove runs out through it; elsewhere the coil stops on its own cap, under a pitch short (no run-out). left_handed climbs the other way. A face past the end or not cylindrical, a size not in the table, a size and a pitch or diameter both given, neither, figures not positive, an angle out of range, the face outside the band, the span past the face, or a cut that removes nothing returns an Error in its Result.

The keyword arguments are a ThreadOptions, default-constructed to the defaults above.

Solid::thread_tool()

Result<Solid> thread_tool(std::uint32_t face, const std::optional<std::string>& size = std::nullopt, const ThreadOptions& options = ThreadOptions()) const

The cutter Solid::thread() cuts with, from the same arguments: one closed coil.

The keyword arguments are a ThreadOptions, default-constructed to the defaults above.

Solid::cosmetic_thread()

Result<Solid> cosmetic_thread(std::uint32_t face, const std::optional<std::string>& size = std::nullopt, const ThreadOptions& options = ThreadOptions()) const

This body unchanged but for a cosmetic thread on face face: validated as Solid::thread() validates it (60 degree flanks), its figures written as the face's attributes thread.designation, thread.major, thread.pitch, thread.length, thread.offset, thread.internal, thread.left_handed and thread.reverse — strings, so they go wherever face attributes go, and every verb carries them to the faces of its result. Refused as Solid::thread() is.

The keyword arguments are a ThreadOptions, default-constructed to the defaults above.

Solid::thread_record()

Result<std::optional<ThreadRecord>> thread_record(std::uint32_t face) const

Face face's cosmetic thread as a ThreadRecord, or std::nullopt where it carries no complete record (every thread.* attribute present and parsable). A face past the end returns an Error in its Result.

Solid::thread_records()

Result<std::vector<std::pair<std::uint32_t, ThreadRecord>>> thread_records() const

Every face's cosmetic thread, as (face, record) pairs in face order.

Solid::rib()

Result<Solid> rib(const NurbsCurve& curve, const Frame& plane, double thickness, RibSide side = RibSide::both, const std::optional<Vec3>& toward = std::nullopt, std::optional<double> tolerance = std::nullopt) const

This body with a rib along curve, an open NurbsCurve lying in plane (a Frame): the region of the plane between the curve and the body on the toward side (a direction in the plane; std::nullopt: toward the body's nearest point), the curve's ends carried on along their tangents until they meet the body, thickened thickness along the plane's normal — side "both" (half each side), "front" (+z) or "back" (-z) — and joined in one boolean (OCCT's linear form). An unknown side, a curve closed or not in the plane, a thickness not positive, a slab that meets nothing, or a region not closed by the body returns an Error in its Result.

Solid::rib_tool()

Result<Solid> rib_tool(const NurbsCurve& curve, const Frame& plane, double thickness, RibSide side = RibSide::both, const std::optional<Vec3>& toward = std::nullopt, std::optional<double> tolerance = std::nullopt) const

The slab Solid::rib() joins, alone, from the same arguments.

Solid::rib_revolved()

Result<Solid> rib_revolved(const NurbsCurve& curve, const Vec3& axis_point, const Vec3& axis_direction, double angle, const std::optional<Vec3>& toward = std::nullopt, std::optional<double> tolerance = std::nullopt) const

This body with a revolved rib: the region Solid::rib() would fill, drawn in the plane holding the axis (through axis_point along axis_direction) and curve (an open NurbsCurve in that plane), clipped to the curve's side of the axis and swung angle radians about it, symmetric about the curve's plane, then joined in one boolean. toward as Solid::rib()'s. An angle not in (0, 2 pi), a zero axis direction, a curve closed or not in one plane with the axis, a slab that meets nothing, or a region not closed by the body returns an Error in its Result.

Solid::rib_revolved_tool()

Result<Solid> rib_revolved_tool(const NurbsCurve& curve, const Vec3& axis_point, const Vec3& axis_direction, double angle, const std::optional<Vec3>& toward = std::nullopt, std::optional<double> tolerance = std::nullopt) const

The solid Solid::rib_revolved() joins, alone, from the same arguments.

Solid::web()

Result<Solid> web(const std::vector<NurbsCurve>& curves, const Frame& plane, double thickness, WebSide side = WebSide::both, std::optional<double> depth = std::nullopt, bool both_ways = false, std::optional<double> tolerance = std::nullopt) const

This body with a web along each of curves (one open NurbsCurve or several, in plane): each offset in the plane to thickness — side "both", "left" or "right" of the curve's run, the plane's normal up — its ends carried along their tangents to the body, its walls run along the plane's normal until they meet the body (depth std::nullopt) or for depth, one way (the normal's) or both when both_ways. All the webs are one tool and one join; crossing curves make a network. An unknown side, no curves, one closed or not in the plane, a thickness not positive, or walls that meet nothing or are not closed by the body returns an Error in its Result.

Solid::web_tool()

Result<Solid> web_tool(const std::vector<NurbsCurve>& curves, const Frame& plane, double thickness, WebSide side = WebSide::both, std::optional<double> depth = std::nullopt, bool both_ways = false, std::optional<double> tolerance = std::nullopt) const

The walls Solid::web() joins, alone, from the same arguments.

Solid::recess()

Result<Recessed> recess(const NurbsCurve& outline, double depth, double draft = 0.0, double fillet = 0.0, bool pane = true, std::optional<double> tolerance = 0.05) const

This sheet with an opening recessed into it along outline — a window, a lamp, a grille or an air intake set into a panel — beside how many of the result's faces are each part's: the sheet's, the fillet's, the walls' and the pane's, the faces in that order. outline is a closed NurbsCurve on the sheet (one face, or several joined by Solid::join_sheets()); each of its points is found on the sheet, so a curve drawn a little off it recesses cleanly. The sheet is cut along it and walls run back depth along the sheet's own normal at every point of the rim — not along one view, so an opening set into a panel that rolls over from side to roof still runs straight in — behind the face (against its normal; negative: in front), leaning in toward the opening by draft radians (negative: out) and meeting on the mitre at the outline's corners. fillet above 0 rounds the rim between the sheet and the walls with a ball of that radius; pane closes the back with one patch whose four sides end where the outline turns most — a rectangle's corners, the middle of a rounded rectangle's corner arcs — so it does not twist. Every piece is sewn to the next: only the sheet's own boundary is left naked, and the walls' foot where there is no pane. An outline that is not closed, a corner with a fillet, or a fillet deeper than the walls returns an Error in its Result.

Solid::health()

Result<HealthReport> health(std::optional<double> tolerance = std::nullopt, bool mesh = false) const

What is wrong with this solid, as a HealthReport: the free edges and the wires they chain into, each with its nearest partner and the gap to it; the features below tolerance; the loose edges; and what sewing would join and leave. Nothing moves. tolerance is an absolute length, as Rhino's model tolerance is, by default 1e-4 times the diagonal; a NaN, infinite, zero or negative one takes the default, and the report shows what was used. A partner is the nearest free edge other than a neighbour on the wire, so a rim reads as a gap the size of the part; shared_ends 2 is what Solid::join_sheets() joins. mesh=True also meshes the solid and reports where the mesh cracks; an open body's crack census is empty by design (not asked), and cracks are only counted on a closed body. Loose edges are compared against the larger of the tolerance recorded and the one given. A solid that cannot be read returns an Error in its Result.

Solid::heal()

Result<std::pair<Solid, HealReport>> heal(std::optional<double> tolerance = std::nullopt, bool edges = true, bool faces = true, bool holes = true) const

This solid with its small features removed, beside a HealReport of what was done and left, as a new Solid; this one is left as it was. It heals what Solid::health() lists as small at the same tolerance, so health first tells what it will do.

Each kind's fix: a short edge's two ends are merged into one vertex and the edge dropped; a collapsed edge (a trim collapsed to a point where its surface is not singular) is dropped; a sliver face's short ends are merged, then the face is dropped and its two long sides sewn into one edge; a tiny face's corners are merged into one vertex and the face is dropped with its edges; a small hole (an inner loop whose edges are all free: a pinhole in an open sheet) is dropped from its face. A hole with walls (a bore) is not a small hole, and a tiny body is listed but never removed.

Everything is a vertex merge no wider than tolerance: a cluster of vertices that spans more, measured by every trim end at them, is refused (chain), so a run of short edges cannot swallow a long one, nor a loosely written corner move an end further. No edit moves a trim further than tolerance: a trim end on a surface pole keeps its uv, an end sent further is left, and a curve edit that would move further is discarded and only the vertex moves. A stack of slivers whose outer faces part by more than tolerance is not sewn across (neighbours_part). Each edge that moved records how far as its Solid::edge_tolerance(), as sewing records a gap; an end that could not move records how far it was left from the merged vertex.

A guard compares the result's health with this solid's. If it is worse — less closed, more free or non-manifold edges, or no faces left — healing retries with the face pass off; if that is still worse, this solid comes back as it was. guarded is set whenever the guard refused a fix. So a lone sliver sheet comes back as a face of two trims: its short ends merged, the sliver refused.

edges, faces and holes switch each kind of fix; a kind switched off is refused as toggled. tolerance std::nullopt, NaN, infinite, zero or negative takes the default, 1e-4 times the diagonal; the report shows what was used. In the browser the reader module's Scene.healed returns the report only: heal the body through the blacksmith module's Solid.heal. A solid that cannot be read returns an Error in its Result.

Solid::edge_tolerance()

Result<std::optional<double>> edge_tolerance(std::uint32_t edge) const

How far edge edge (a brep edge id, as a HealFix or FreeEdge names one) may lie off its curve: 0 for an exact edge, the distance healing or sewing moved it where that is recorded, std::nullopt when no trim names the id (an edge healing removed). A solid that cannot be read returns an Error in its Result.

Solid::recognize()

Result<std::pair<Solid, RecognizeReport>> recognize(std::optional<double> tolerance = std::nullopt) const

This solid with its free-form surfaces and edge curves given their analytic kind, beside a RecognizeReport of what was taken and left, as a new Solid; this one is left as it was. A NURBS, revolved, extruded or swept surface that is a plane, cylinder, cone, sphere or torus within tolerance of every sample of its faces and every point of their edges becomes exactly that; an edge curve that is a line, circle or ellipse within it likewise, over the same stretch run the same way. So a file that stored its analytic faces as NURBS — a .3dm above all, and many STEP and SAT exports — comes back as it was made, and verbs that read a face's kind (a hole's axis, a fillet's radius) work on it.

Faces and edges keep their numbers, so a face or edge picked before is the same one after. The faces of one surface are taken together or not at all. A face given only by trims in its old surface's parameters (.3dm, IGES) is lifted to space edges first. Volume and area move by no more than the tolerance allows.

tolerance std::nullopt, NaN, infinite, zero or negative takes the default, 1e-6 of the body's extent; the report shows what was used. Not the file's declared tolerance: at a STEP file's usual 0.01, a fillet's blend reads as a torus and the body's area moves by parts in a thousand. In the browser the reader module's Scene.recognized returns the report only: recognise the body through the blacksmith module's Solid.recognize. A solid that cannot be read returns an Error in its Result.

Solid::tolerances()

Result<Tolerances> tolerances() const

What this solid declares about its own precision, as Tolerances: read from its file, inherited through every verb from the loosest of its inputs, or set by Solid::with_tolerances(); none in a field nothing declared. A verb given no tolerance works at cadaclysm::blacksmith::effective_tolerance(), which takes it into account.

Solid::with_tolerances()

Result<Solid> with_tolerances(std::optional<double> absolute = std::nullopt, std::optional<double> angular = std::nullopt) const

A new solid: this one declaring absolute (a length) and angular (radians) instead of what it declared, its name, paint and marks kept. None or 0 declares nothing for that field; a negative or infinite value returns an Error in its Result.

Solid::vertex_tolerance()

Result<std::optional<double>> vertex_tolerance(const Vec3& point) const

How loose this solid's vertex at point is, where its producer said (an OCCT .brep records one per vertex): the tolerance of the nearest recorded vertex within its own tolerance of point. None where none is recorded there.

Solid::push_pull()

Result<Solid> push_pull(std::uint32_t f, double distance, std::optional<double> tolerance = DEFAULT_TOLERANCE, const Progress& progress = {}) const
Result<Solid> push_pull(const std::vector<std::uint32_t>& which, double distance, std::optional<double> tolerance = DEFAULT_TOLERANCE, const Progress& progress = {}) const
Result<Solid> push_pull(std::initializer_list<std::uint32_t> which, double distance, std::optional<double> tolerance = DEFAULT_TOLERANCE, const Progress& progress = {}) const

Face face pushed out by distance along its outward normal — pulled in, negative — as a face extrude does it: the prism over it joined on (cut out) at tolerance, and the flush faces merged, so a box's top raised is one taller box of six faces rather than a box and a prism with every side wall split at the seam. A face on a cylinder, a cone, a sphere or a torus moves out along its normal instead, as a press-pull does: the surface a step out — a boss fatter, a bore or a countersink narrower, a dome fuller — with the flat faces beside it carried along in their own planes. Any other curved face is refused, as is a curved face with anything but a plane it can follow beside it, reaching a cone's apex, pushed to its axis or centre, off a plane beside it or run into another edge. A flat face keeps its own colour where it now lies.

Several faces push together, as a press-pull on a selection: each by its own rule, one after another in the order given, each found again after the pushes before it renumbered the faces — a box's top and a side pushed 5 is the box 5 taller and 5 wider, a boss's top and wall the boss taller and fatter. A face on the same curved surface as one before it, and joined to it, moved with that one and is not pushed twice. No faces, or a face an earlier push took away, returns an Error in its Result.

Overloaded: a face index, or a std::vector<std::uint32_t> of them.

Solid::refillet()

Result<Solid> refillet(std::uint32_t f, double radius, std::optional<double> tolerance = FILLET_TOLERANCE) const

The round face belongs to — a fillet's bands, balls and rim bands joined to that face — made again at radius, as a press-pull on a fillet face: taken back to the sharp edges it replaced, and those rounded again, so the round is the one Solid::fillet() makes at that radius. Rounds of straight edges between planes (their ends square corners, mitres, balls, or a cylinder, cone or sphere the edge runs into — a D-cut shaft's top edge, a rib's into a boss) and of circular rims between a plane and a cylinder or cone (a boss's foot, a bore's mouth, a counterbore's step); a face that is not one, or a radius that does not fit, returns an Error in its Result.

Solid::unfillet()

Result<Solid> unfillet(std::uint32_t f) const

The round face belongs to taken off, the faces beside it made sharp again, meeting on the edges the round replaced — the delete of a fillet face. The same rounds as Solid::refillet().

Solid::rechamfer()

Result<Solid> rechamfer(std::uint32_t f, double distance, std::optional<double> tolerance = FILLET_TOLERANCE) const

The chamfer face belongs to — its bevels (flat between two planes, cones round rims) and the corner triangles joined to that face — cut again at distance, as a press-pull on a chamfer face: taken back to the sharp edges it cut, and those bevelled again, so the chamfer is the one Solid::chamfer() cuts at that distance. A flat bevel's ends may run into a cylinder, cone or sphere, as a round's may. A face that is not a chamfer's bevel, or a distance that does not fit, returns an Error in its Result.

Solid::unchamfer()

Result<Solid> unchamfer(std::uint32_t f) const

The chamfer face belongs to taken off, the faces beside it made sharp again — the delete of a chamfer face. The same chamfers as Solid::rechamfer().

Solid::face_round_radius()

Result<double> face_round_radius(std::uint32_t face) const

The radius of the round face belongs to — one Solid::unfillet() can take back — or 0 where it is none: only the cylinders, spheres and tori a fillet made are asked. A face the solid does not have returns an Error in its Result.

Solid::face_chamfer_distance()

Result<double> face_chamfer_distance(std::uint32_t face) const

The distance of the chamfer face belongs to — one Solid::unchamfer() can take back — or 0 where it is none: only the planes and cones a chamfer made are asked. A face the solid does not have returns an Error in its Result.

Solid::merge_flush()

Result<Solid> merge_flush() const

This solid with its flush faces merged: flat faces on one plane, facing one way and meeting along their edges — the seams Solid::join() leaves where two parts are flush — made one face, and the vertices left mid-way along a straight edge taken out.

Solid::split()

Result<std::vector<Solid>> split(const Solid& tool, std::optional<double> tolerance = DEFAULT_TOLERANCE, const Progress& progress = {}) const

This solid split by tool into bodies — returned as a list: a closed tool gives the parts outside it, then the parts inside; a flat sheet (a Solid::face()) splits by the whole plane it lies on. Each connected part is a body of its own, so a U cut across both arms is three. The new faces are pieces of the tool's, the colours carried over. A tool that does not cross the solid, or a curved sheet, returns an Error in its Result. tolerance and progress as for Solid::join().

Solid::split_by_plane()

Result<std::vector<Solid>> split_by_plane(const Frame& plane, std::optional<double> tolerance = DEFAULT_TOLERANCE, const Progress& progress = {}) const

This solid split by the plane through plane's origin, square to its z (a frame): the bodies in front of it first, then those behind.

Solid::split_by_profile()

Result<std::vector<Solid>> split_by_profile(const Profile& profile, const Frame& frame, std::optional<double> tolerance = DEFAULT_TOLERANCE, const Progress& progress = {}) const

This solid split by the closed Profile profile drawn on frame, pushed straight through it along the frame's z both ways — a split by a sketch profile: the bodies outside the profile first, then those inside. Where the plane lies along z does not matter, only the outline across it: a circle cores a sphere wherever it is drawn above it. The new faces are the profile's walls exactly. A profile that misses the solid, takes all of it or encloses nothing returns an Error in its Result. tolerance and progress as for Solid::join().

Solid::lumps()

Result<std::vector<Solid>> lumps() const

This solid's connected bodies, each a solid of its own — faces sharing an edge are one body — in the order of their first faces. One body comes back as itself; a boolean that leaves two parts gives two.

Solid::merge()

Result<Solid> merge(const Solid& other, std::optional<double> tolerance = DEFAULT_TOLERANCE, const Progress& progress = {}) const

This solid and other as one body that keeps every piece — a union that keeps the inside pieces, as Rhino's MergeBreps: every face of both, split where they cross, the walls they share stored once. Its Solid::regions() are this solid less other, the two together and other less this one, those that are not empty; one solid inside the other gives the outer one with a void and the inner one, two solids apart give both. Faces keep the colours of the faces they are pieces of.

The body is non-manifold: where a wall between two cells meets the outside, an edge has three or four faces. The verbs that need a manifold solid — Solid::join(), Solid::cut(), Solid::common(), the splits and trims, Solid::fillet(), Solid::chamfer(), Solid::shell(), Solid::thicken(), Solid::mass() and the STEP writer — refuse it and name the way out: take each cell with Solid::region_solid().

Built exactly, on the exact boolean route: both solids closed, every face a plane, cylinder, cone, sphere or torus. A face of any other kind returns an Error in its Result, naming it; so do walls of the two lying on one another in part (two boxes sharing part of a side, equal solids) — a case the exact route does not take yet, refused in words, with no mesh fallback. tolerance (0.05 by default) is the resolution the sections are found to; progress as for Solid::join().

Solid::draft()

Result<Solid> draft(const std::vector<std::uint32_t>& faces, const Frame& plane, double angle, std::optional<double> tolerance = std::nullopt, const Progress& progress = {}) const

Faces faces drafted to angle (radians) against the pull direction plane's z, about the neutral plane through plane's origin square to it — OCCT's BRepOffsetAPI_DraftAngle, Fusion's Draft. angle is each face's new draft angle, absolute, in (-pi/2, pi/2): asin(n . d), n the face's outward normal and d the pull, so it is positive where the face looks partly along the pull — an outer wall narrowing towards +z, a hole widening. A plane turns about the line where it crosses the neutral plane, which stays where it was; a cylinder along the pull becomes the cone through the circle it cuts there (a cone along the pull the same from its own circle). The faces beside a drafted one follow it, every vertex moving onto the drafted faces and the planes it lay on, a vertex in the neutral plane not at all; the faces keep their order, colours and marks. A face parallel to the neutral plane, a cylinder across the pull, a sphere, torus or free-form face, a curved neighbour not drafted with it, a hole through a drafted plane, a face that closes up at the angle asked, or a result that does not close returns an Error in its Result. tolerance and progress as for Solid::join().

Solid::draft_two_sided()

Result<Solid> draft_two_sided(const std::vector<std::uint32_t>& faces, const Frame& plane, double above, double below, std::optional<double> tolerance = std::nullopt, const Progress& progress = {}) const

Faces faces drafted both ways from the neutral plane plane — a parting line: above it (along its z) to above against +z, below it to below against -z, so for positive angles both halves narrow away from the plane; above == below is Fusion's symmetric draft. A face wholly on one side is drafted as Solid::draft() drafts it; otherwise the solid is split by the plane, each side drafted, and the halves joined back on their cut faces, the faces the plane cut in two made one again. The faces come back in the join's order, each keeping its colour, a drafted half its face's. What Solid::draft() refuses returns an Error in its Result here too.

Solid::draft_angle_at()

Result<DraftPoint> draft_angle_at(std::uint32_t face, const Vec3& point, const Vec3& pull) const

The point of face face nearest point and the draft angle there against the pull direction pull (normalised), as a DraftPoint — Rhino's BrepFace.DraftAnglePoint. The angle is Solid::draft()'s, asin(n . d): +pi/2 a top, 0 a wall along the pull, -pi/2 a bottom; a point on the face's boundary reads the face's own normal there, not the mean of the faces meeting. A face index out of range, a point not finite, or a pull zero or not finite returns an Error in its Result.

Solid::draft_analysis()

Result<std::vector<FaceDraft>> draft_analysis(const Vec3& pull, double threshold = 0.017453292519943295, std::optional<double> tolerance = std::nullopt) const

Every face's draft against pull (normalised), one FaceDraft per face in face order — Fusion's draft analysis. The body is meshed at tolerance (none: the effective one); each triangle's angle is read exactly at its centre and its area banded by threshold (radians, in [0, pi/2), 1 degree by default) into positive, negative and vertical; a triangle drafting either way casts a ray along the way it releases, and one that meets the body is undercut — a ledge under an overhang. A pull zero or not finite, a threshold out of range, or a negative tolerance returns an Error in its Result.

Solid::sheet_base()

static Result<Solid> sheet_base(const Profile& profile, const SheetRule& rule, const std::optional<Frame>& frame = std::nullopt, std::optional<double> tolerance = std::nullopt)

The base flange: profile as a flat sheet under frame (none: the world's xy), its top in the frame's plane and the sheet the SheetRule's thickness below it — Fusion's Flange from a sketch, Inventor's Face. A rule out of range returns an Error in its Result.

Solid::sheet_contour()

static Result<Solid> sheet_contour(const std::vector<Vec2>& path, double width, const SheetRule& rule, const std::optional<Frame>& frame = std::nullopt, std::optional<double> tolerance = std::nullopt)

A contour flange: the open path path (points in frame's plane, the sheet seen edge on) swept width along the frame's z, each corner a bend of the rule's radius. A path of fewer than two points, a corner too tight for the bend, or a width not positive returns an Error in its Result.

Solid::sheet_lofted_flange()

static Result<Solid> sheet_lofted_flange(const std::vector<Vec3>& a, const std::vector<Vec3>& b, const SheetRule& rule, std::optional<double> tolerance = std::nullopt)

A lofted flange between the open polylines a and b (points, at least two each), the sheet's top face — Fusion's Lofted Flange, press-brake style: the strip between them is cut into facets (neighbours in one plane merged), every crease a bend of the rule's radius, so the part reads and unfolds like any other. Sample an arc into as many points as facets wanted (a square-to-round is a square's sides and a sampled circle). The sheet lies under the facets' normal, along a crossed with towards b: reverse both to put it on the other side. Each facet is cut back by its bends' set-backs and each bend zone ends square a little inside its facets, so the outline steps in at each end of a crease. Fewer than two points, a repeated point, a facet with no area, or a facet its bends' set-backs leave nothing of (fewer facets or a smaller radius) returns an Error in its Result.

Solid::sheet_flange()

Result<Solid> sheet_flange(const std::vector<std::uint32_t>& edges, double angle, double length, const SheetRule& rule, const std::optional<std::array<double, 2>>& offsets = std::nullopt, std::optional<double> tolerance = std::nullopt) const

Edge flanges on edges (edges of a broad face of a sheet body), each turned angle radians (> 0 up, towards the side the edge's face looks) and length high outside, bent at the rule's radius. offsets none for flanges the full length of their edges, else how far in each starts from its edge's two ends, the rule's bend relief cut there. Two flanges meeting at a corner are mitred with the rule's gap. An edge not on a broad face's rim, a body that is not sheet metal, an angle out of range or a length shorter than the bend returns an Error in its Result.

Solid::sheet_hem()

Result<Solid> sheet_hem(const std::vector<std::uint32_t>& edges, HemKind kind, double length, const SheetRule& rule, double gap = 0.0, double angle = 0.0, std::optional<double> tolerance = std::nullopt) const

Hems on edges: kind flat (the lip folded flat on the sheet), open (folded back with a gap), rolled (rolled round through angle, 0: 1.5 pi), teardrop, rope (curled round a rod gap across until it comes back down to the sheet) or double (folded twice and pressed flat, three layers); length the lip (a rope hem has none), gap the gap inside (0: the thickness). What Solid::sheet_flange() refuses returns an Error in its Result here too.

Solid::sheet_fold()

Result<Solid> sheet_fold(std::uint32_t face, const std::array<Vec3, 2>& line, double angle, const SheetRule& rule, std::optional<double> tolerance = std::nullopt) const

A bend on the line through the two points line across the flat broad face face: the material on the line's left, seen from the face's outside, turned angle radians — Fusion's Bend. A face that is not a flat broad face, a line that does not cross it, or a fold through another bend returns an Error in its Result.

Solid::sheet_rip()

Result<Solid> sheet_rip(const std::vector<std::uint32_t>& edges, double gap = 0.0, std::optional<double> tolerance = std::nullopt) const

Rips along edges (sharp edges between two walls of a shelled solid): a slot gap wide (0: a tenth of the wall) through the wall, so Solid::sheet_convert() can lay a closed box flat.

Solid::sheet_convert()

Result<Solid> sheet_convert(std::uint32_t fixed_face, const SheetRule& rule, std::optional<double> tolerance = std::nullopt) const

A shelled solid of constant thickness made sheet metal from fixed_face: every sharp edge between two flat broad faces becomes a bend of the rule's radius, the outside kept — Fusion's Convert to Sheet Metal. A solid not of one thickness, or a closed loop of walls that needs a rip first, returns an Error in its Result.

Solid::sheet_corner_relief()

Result<Solid> sheet_corner_relief(const SheetRule& rule, std::optional<double> tolerance = std::nullopt) const

The rule's corner relief (square, round or tear, its size) cut at every corner where two bend zones end close together.

Solid::sheet_rip_points()

Result<Solid> sheet_rip_points(std::uint32_t face, const Vec3& a, const Vec3& b, double gap = 0.0, std::optional<double> tolerance = std::nullopt) const

A rip from point a to point b on the flat broad face face — Fusion's point-to-point rip: a slot gap wide (0: a tenth of the thickness) cut through that wall only. An end on the face's outline breaks through it; an end inside the face stops there, a slit. Works on any body of one thickness, folded or not. A face that is not a flat broad face, or a point off it, returns an Error in its Result.

Solid::sheet_rip_face()

Result<Solid> sheet_rip_face(std::uint32_t face, std::optional<double> tolerance = std::nullopt) const

The wall under the broad face face (flat or a bend) removed through the thickness — Fusion's face rip: a closed box opened, a bend ripped out between its two walls. A face that is not a broad face, or a rip that leaves nothing, returns an Error in its Result.

Solid::sheet_join()

Result<Solid> sheet_join(std::uint32_t edge_a, std::uint32_t edge_b, const SheetRule& rule, std::optional<double> tolerance = std::nullopt) const

Two walls joined by a bend of the rule's radius — Fusion's Join by Bend. edge_a and edge_b are outline edges where each wall's broad face meets its square end, parallel and of one extent: each wall runs on to the other's far face, which makes one sharp corner with the outer faces meeting on the mould line, and the corner is bent, both legs kept to that line. Walls in one plane facing each other are joined flat. Two parts are Solid::join()ed into one body first. Edges that are not wall ends, not parallel or of different extent, walls that overlap or lie parallel in two planes, or a rule thickness not the walls', returns an Error in its Result.

Solid::sheet_fillet()

Result<Solid> sheet_fillet(const std::vector<std::uint32_t>& edges, double radius, const SheetRule& rule, std::optional<double> tolerance = std::nullopt) const

Rounds of radius on thickness edges (straight edges across the sheet where two of its sides meet, at a corner of the outline, on a flat region) — Fusion's sheet-metal fillet. Each is a corner of the flat pattern: rounded there (cut on a convex corner, filled on a concave one) and the part folded again, so it stays sheet metal and Solid::flat_pattern() lays the round flat. An edge that is not a thickness edge, an edge on a bend, or a round that runs past the sides beside it returns an Error in its Result.

Solid::sheet_chamfer()

Result<Solid> sheet_chamfer(const std::vector<std::uint32_t>& edges, double distance, const SheetRule& rule, std::optional<double> tolerance = std::nullopt) const

Chamfers distance along both sides on thickness edges, laid into the flat pattern as Solid::sheet_fillet() lays its rounds. What it refuses returns an Error in its Result here too.

Solid::is_sheet_metal()

bool is_sheet_metal(std::optional<double> tolerance = std::nullopt) const

Whether the body reads as sheet metal: two broad sides of constant thickness, flat faces and cylindrical bends, side faces one thickness wide.

Solid::sheet_bend_faces()

Result<std::vector<std::uint32_t>> sheet_bend_faces(std::optional<double> tolerance = std::nullopt) const

The faces of every bend, two a bend (inner and outer). A body that is not sheet metal returns an Error in its Result.

Solid::sheet_info()

Result<SheetInfo> sheet_info(std::optional<std::uint32_t> fixed_face = std::nullopt, std::optional<double> tolerance = std::nullopt) const

The body read as sheet metal from fixed_face (none: its largest flat broad face), as a SheetInfo: its thickness, the face it is laid from, and every bend as a BendInfo. A body that is not sheet metal returns an Error in its Result.

Solid::flat_pattern()

Result<FlatPattern> flat_pattern(std::uint32_t fixed_face, const SheetRule& rule, std::optional<double> tolerance = std::nullopt) const

The body unfolded from the flat broad face fixed_face under the rule, as a FlatPattern: every bend laid flat at its allowance |angle| (R + K T) — OCCT has no sheet metal; Fusion's and Inventor's Flat Pattern. A body that is not sheet metal, a face that is not a flat broad face, a rule thickness not the body's, or a flat that overlaps itself returns an Error in its Result.

Solid::fold_flat()

static Result<Solid> fold_flat(const Profile& profile, const std::vector<Bend>& bends, const SheetRule& rule, const std::optional<Frame>& frame = std::nullopt, std::optional<double> tolerance = std::nullopt)

A flat outline folded: profile under frame (none: the world's xy), each of bends (a Bend) a bend — a FlatPattern's outline and fold bends, edited and folded again. A bend line that does not cross the outline, or two bends crossing, returns an Error in its Result.

Solid::unroll()

Result<Unrolled> unroll(const std::vector<std::uint32_t>& faces = {}, const std::vector<NurbsCurve>& curves = {}, const std::vector<Vec3>& points = {}, bool explode = false, std::optional<double> tolerance = std::nullopt) const

Faces faces (none: all) laid flat in the xy plane, as an Unrolled — Rhino's Unroller. Planes, cylinders and cones unroll exactly, any other surface whose Gaussian curvature vanishes within tolerance by its own flattening. Faces sharing an edge stay joined unless joined they would overlap (or explode), the largest face placed first. curves follow onto the flat, in pieces where they cross a cut, and points to their spots. A face that is not developable is left out and reported, never stretched. A face out of range, or no developable face, returns an Error in its Result.

Solid::squish()

Result<Squished> squish(const std::vector<std::uint32_t>& faces = {}, const std::vector<NurbsCurve>& curves = {}, const std::vector<Vec3>& points = {}, bool explode = false, SquishDeformation deformation = SquishDeformation::free, bool preserve_boundary = true, std::optional<double> tolerance = std::nullopt) const

Faces faces (none: all) laid flat in the xy plane with the least distortion, developable or not, as a Squished — Rhino's Squisher, the companion to Solid::unroll(). Faces sharing an edge flatten together unless explode; a group whose faces are all developable is laid exactly as Solid::unroll() lays it, the others are meshed finely and relaxed (a conformal start, then an energy over each triangle's stretch). deformation reads from the flat to the shape, as Rhino's: "free", "stretch_mostly" and "stretch_only" (flat lengths at most their 3D lengths: the pattern stretches to cover the shape), "compress_mostly" and "compress_only" (at least); *only* holds in every triangle in every direction. preserve_boundary (on by default) keeps the outline's length. curves follow onto the flat (in pieces where they leave the faces), points to their spots. A face out of range, a bad deformation, or faces that close on themselves (a closed surface has no edge to open from) returns an Error in its Result.

Solid::regions()

Result<std::vector<Region>> regions() const

The regions of space this solid's faces bound, as Region values — Rhino's GetRegions, computed on demand from the faces' order round every edge. Region 0 is the infinite one, the outside; the finite ones follow in a fixed order, so the same body gives the same list. An ordinary solid has two (the outside, in front of every face, and the inside, behind them), a Solid::merge() one per cell, a solid with a cavity three (the cavity is a region of its own).

Each region lists its sides as FaceSide values: a face and its sense, +1 where the region is the side the face's normal points to, -1 the other — a solid's own inside is behind its faces, at -1. Its shells come outer boundary first, then one per void inside it. Faces that leave an edge the same way (tangent along it, to the second order) returns an Error in its Result.

Solid::region_solid()

Result<Solid> region_solid(std::uint32_t region) const

Finite region region (an index into Solid::regions()) as a closed solid of its own — Rhino's BrepRegion.BoundaryBrep: the faces bounding it, each turned to point out of it, each keeping its colour. A Solid::merge()'s cells come out one at a time this way, ready for Solid::mass() and the booleans. A closed manifold unless the region touches itself along an edge. Region 0 (the infinite region) or a region past the count returns an Error in its Result.

Finishing

Solid::edges()

Result<std::vector<Edge>> edges() const

The solid's edges as Edge values — what Solid::fillet() and Solid::chamfer() take. Copied; safe to keep.

Solid::fillet()

Result<Solid> fillet(const std::vector<std::uint32_t>& edge_indices, double radius, std::optional<double> tolerance = FILLET_TOLERANCE, const Progress& progress = {}, std::optional<double> radius_end = std::nullopt) const

Round the given edges (Edge values or their indices) with radius. Exact: the blend faces are cylinders, tori and NURBS, and the neighbours are trimmed back onto them. A spline edge — the crease between two faces on NURBS surfaces, running from one free edge of the shell to another, as between a fender patch and a door patch — is rounded by a ball rolled along it, the two faces cut back to where it touches them, in a call of its own (not with straight or circular edges); tolerance is then the fillet surface's fit. radius_end (spline edges only) runs the radius linearly from radius to it in arc length along the edge. A spline edge ending where other shared edges meet, a closed one, or a varying radius on a straight or circular edge returns an Error in its Result.

Solid::fillet_law()

Result<Solid> fillet_law(const std::vector<std::uint32_t>& edge_indices, const std::vector<std::pair<double, double>>& law, std::optional<double> tolerance = FILLET_TOLERANCE) const

Round a chain of spline edges (Edge values or their indices) with the radius following a law: law is the radius at stations along the chain, each (share, radius) — the share of the chain's arc length from its start, 0 to 1 — run through smoothly by a monotone cubic, so the radius never swings past its stations, and held flat before the first station and after the last. [(0, 4), (1, 12)] grows from 4 at one end to 12 at the other, as a car's shoulder fillet does. The edges must run end to end into one open chain, each running on tangent into the next; the chain runs the way the first edge's curve does. Where the faces either side change from one edge to the next they must meet smooth along a seam through the vertex between, and the fillets meet on one shared end there. tolerance is the fillet surfaces' fit. Straight or circular edges, a branching or closed chain, or edges meeting at an angle returns an Error in its Result.

Solid::fillet_chord()

Result<Solid> fillet_chord(const std::vector<std::uint32_t>& edge_indices, double chord, std::optional<double> tolerance = FILLET_TOLERANCE) const

Round the given edges (Edge values or their indices) with a rolling ball sized so the chord between its rails — the straight line across the fillet from one face to the other — is chord long: Rhino's distance-between-rails rail type, Fusion's chord-length fillet. It reaches every edge Solid::fillet() reaches. Straight edges and partial arcs share one radius per call, so edges whose faces meet at different angles returns an Error in its Result — round them in calls of their own; a whole rim takes its own radius; along a spline edge between NURBS faces the radius varies so the chord holds, and a crease that folds or flattens returns an Error in its Result. A box's edge rounded by chord c is the fillet of c/√2. tolerance is the fillet surfaces' fit.

Solid::fillet_asymmetric()

Result<Solid> fillet_asymmetric(const std::vector<std::uint32_t>& edge_indices, std::uint32_t f, double distance, double distance_other, std::optional<double> tolerance = FILLET_TOLERANCE) const

Round the given edges (Edge values or their indices) with two set-backs: each edge is cut back distance along face face (an index; every edge must border it) and distance_other along its other face, and the section between is the exact conic tangent to both faces — an elliptic arc, the rolling-ball circle when the distances are equal (then it is Solid::fillet() at d·tan(θ/2), Rhino's distance-from-edge rail type). Fusion's asymmetric fillet. Straight edges between planes, convex or concave, ending square or oblique against planes, joined end to end in a line, or two meeting at a convex corner with matching sections (a box's top rim, mitred). Circular edges and rims, spline edges, curved end faces, a chain running into a tangent arc and corners where the sections differ returns an Error in its Result.

Solid::fillet_full_round()

Result<Solid> fillet_full_round(std::uint32_t side, std::uint32_t centre, std::uint32_t other_side, std::optional<double> tolerance = FILLET_TOLERANCE) const

A full round: face centre (an index) replaced by a round tangent to faces side and other_side either side of it — Fusion's full round fillet. A rib's flat top between two parallel walls becomes a half cylinder; a tube's top, a ring between two coaxial walls, becomes a half torus. The radius is not given but solved from the three faces: sides w apart give w/2. centre must be a plane and each side must share an edge with it; a face index past the solid's faces, the same face as both sides, a tapered rib, a disc top, curved end faces and side faces lower than the round returns an Error in its Result.

Solid::fillet_rule()

Result<Solid> fillet_rule(const std::vector<std::uint32_t>& faces, double radius, const std::vector<std::uint32_t>& between = {}, EdgeRule rule = EdgeRule::all, std::optional<double> tolerance = FILLET_TOLERANCE) const

Solid::fillet() at radius of the edges a rule picks — Fusion's rule fillet. With between empty every edge with a face in faces (indices) is a candidate, otherwise every edge between a face in faces and one in between; of those rule keeps the convex and the concave ones (all, the default), the concave ones only (concave, the valleys) or the convex ones only (convex, the ridges), classed at the solid's own angular tolerance. Smooth edges, and edges convex along part of their length and concave along another, are never picked. No faces, a face index past the solid's faces, an unknown rule, nothing picked, or anything the fillet itself refuses returns an Error in its Result.

rule is a blacksmith::EdgeRule (all, concave, convex).

Solid::chamfer()

Result<Solid> chamfer(const std::vector<std::uint32_t>& edge_indices, double distance, std::optional<double> tolerance = FILLET_TOLERANCE) const

A flat bevel instead of a round: each edge cut back distance along both its faces.

Solid::shell()

Result<Solid> shell(double thickness, const std::vector<std::uint32_t>& open_faces = {}, std::optional<double> tolerance = FILLET_TOLERANCE, const Progress& progress = {}) const

Hollow the solid to walls thickness thick — inward for a positive thickness, outward (the solid becoming the cavity) for a negative one. The faces listed in open are removed so the hollow is reachable.

Solid::thicken()

Result<Solid> thicken(double thickness, std::optional<double> tolerance = FILLET_TOLERANCE, const Progress& progress = {}) const

A sheet made a solid thickness thick: its faces, their twins moved thickness along the faces' normals (against them for a negative thickness), and a wall round every open edge. Two faces of a folded sheet meet on their offsets' mitre; a closed sheet thickens to a hollow. Free-form (NURBS) faces offset by a fit held to tolerance. A thickness a face cannot take — a radius used up, a free-form offset folding over — returns an Error in its Result.

Solid::offset()

Result<Solid> offset(double distance, std::optional<double> tolerance = std::nullopt) const

This solid offset by distance: every face moved along its outward normal — outward for a positive distance, inward for a negative one — and the moved faces' new neighbours meeting at sharp joins, on their offsets' intersection (no rounded joins). A closed solid grows or shrinks to the solid its moved skin bounds; an open sheet moves to its twin, its rims left open. Each face keeps the colour, id and attributes of the face it was moved from, however far it moved; edges are matched by position. A face the offset uses up is gone, its neighbours meeting sharp. Free-form faces are fitted within tolerance (none: the solid's effective tolerance). A distance that is 0, NaN or infinite, a face that folds over, or a skin the offset leaves open returns an Error in its Result.

Solid::offset_face()

Result<Solid> offset_face(std::uint32_t face, double distance, std::optional<double> tolerance = std::nullopt) const

Face face alone, as an open sheet moved distance along its outward normal (against it for a negative distance), still facing this solid's way, in the face's own colour: Solid::face_sheet() then Solid::offset(). A face closed on itself — a sphere's only face — gives a closed solid. tolerance as for Solid::offset(). A face this solid has not, a distance that is 0, NaN or infinite, or an offset that folds over returns an Error in its Result.

Asking

Solid::faces()

std::uint32_t faces() const

How many faces.

Solid::face_kind()

Result<std::string> face_kind(std::uint32_t f) const

A face's surface: plane, cylinder, cone, sphere, torus, nurbs, revolution, extrusion or other.

Solid::select_face()

Result<std::uint32_t> select_face(const Selector& selector) const

The index of the face a Selector picks.

Solid::face_frame()

Result<Frame> face_frame(std::uint32_t f) const

The frame on a face: origin at its centre, z its outward normal, x world X laid onto the face (world Y on a face facing close to X) — Frame::at()'s rule, so the top of a box gets the XY plane's axes. What Workplane::workplane() moves onto.

Solid::face_ref()

Result<std::array<double, 8>> face_ref(std::uint32_t f) const

A face by what it is, eight numbers: the surface's kind (plane 0, cylinder 1, cone 2, sphere 3, torus 4, NURBS 5, revolution 6, extrusion 7, sum 8), a point on the surface at the face's middle (x, y, z), the outward normal there (x, y, z), and the face's extent. What a feature made on a face keeps — a sketch on it, a shell's opening — so the face is found again with Solid::find_face() when the solid is rebuilt with its faces moved, split or renumbered. Take it before any move you apply to the solid, and look it up on the unmoved one.

Solid::find_face()

Result<std::optional<std::uint32_t>> find_face(const std::array<double, 8>& ref, std::optional<std::uint32_t> hint = std::nullopt, std::optional<double> tolerance = 1e-3) const

The face a reference from Solid::face_ref() refers to: among the faces of that kind whose surface passes through the point, facing the same way, the one the point lies in — or, where it lies in none (the face shrank away, a hole opened under it), the one whose boundary comes nearest. hint is the index the face had, preferred among faces that fit equally well; tolerance how far the point may sit off a surface to still be on it. None where the face is gone.

Solid::bounds()

Result<std::pair<Vec3, Vec3>> bounds() const

The axis-aligned box, at the same cost whatever the solid's size: its mesh at a thousandth of its own extent, in double, so the box is inside the exact one and short of it by at most that. Worked out once per solid, apart from the tessellation Solid::mesh() caches. Solid::bounds_at() is the box of the mesh at a tolerance you name.

Solid::bounds_at()

Result<std::pair<Vec3, Vec3>> bounds_at(double tolerance) const

The bounds over the tessellation at tolerance — the same cache Solid::mesh() fills, so asking both costs one mesh.

Solid::bounds64()

Result<std::pair<Vec3, Vec3>> bounds64(std::optional<double> tolerance = DEFAULT_TOLERANCE) const

Solid::bounds() in double precision: the axis-aligned bounds over the mesh's unnarrowed positions at tolerance (0.05 where the language defaults it) — exact far from the origin, where Solid::bounds()'s float32 mesh is not.

Solid::leaked_edges()

Result<std::uint32_t> leaked_edges(std::optional<double> tolerance = DEFAULT_TOLERANCE) const

How many mesh edges at tolerance are bound by anything other than two triangles: zero for a closed solid. A seam two solids share along a line does not count; a hole or a fold does.

Solid::unpaired_edges()

Result<std::uint32_t> unpaired_edges(std::optional<double> tolerance = DEFAULT_TOLERANCE) const

How many mesh edges have triangle uses that do not cancel out: zero for a closed, consistently oriented solid. Unlike Solid::leaked_edges() this catches a fold — two triangles running the same way.

Solid::is_watertight()

Result<bool> is_watertight(std::optional<double> tolerance = DEFAULT_TOLERANCE) const

Whether Solid::leaked_edges() is zero.

Solid::manifold()

Result<Manifold> manifold() const

Whether the faces make a manifold — every edge bordered by one face or two, the faces round every vertex one fan — and whether it is closed, as a Manifold. Read off the solid's topology, not a mesh, so it takes no tolerance; whether the faces all face out is Solid::unpaired_edges()'s question.

Solid::edge_beziers()

Result<std::vector<double>> edge_beziers(std::optional<double> tolerance = std::nullopt) const

The edges as rational cubic Béziers, sixteen numbers each — x, y, z, w per control point, the point Cartesian and its weight beside it, the record a profile's Béziers use — what a viewer draws the edges by: exact where an edge's curve has a Bézier form (a line one Bézier, a circle quarter-turn conics, a spline its own pieces), flattened within tolerance where it has none (left out: the solid's effective tolerance). A tolerance negative or infinite returns an Error in its Result.

Solid::isocurve_beziers()

Result<std::vector<double>> isocurve_beziers(std::uint32_t density = 4, std::optional<double> tolerance = std::nullopt) const

The faces' isoparametric curves as Béziers, sixteen numbers each as Solid::edge_beziers() gives them: density interior lines each way on every curved face, clipped to the face, plus the lines at the ends of its parameter span; a flat face draws none. Exact where the surface has a closed form for the line (a cylinder's rings are circles), flattened within tolerance elsewhere.

Solid::face_iso_intervals()

Result<std::vector<std::pair<double, double>>> face_iso_intervals(std::uint32_t face, bool along_u, double at) const

The intervals of the swept parameter along which face face's isocurve lies inside its trims, as Rhino's TrimAwareIsoIntervals, ascending, as (start, end) pairs: along u at v = at when along_u, else along v at u = at. NurbsCurve::face_isocurves() gives the pieces as curves. A face past the end or an at not finite returns an Error in its Result.

Solid::mass()

Result<Mass> mass(double accuracy = 0.0) const

What this solid measures, per unit density, as a Mass: area, volume, centroid, the inertia tensor about the centroid and its principal moments and axes — each figure beside a bound on its own error. Measured on the exact surfaces, refined until every error is under accuracy (a share of the figure) or the refinement gives up, which Mass::accuracy_met reports; the values are honest either way, they are simply less certain, and the errors say by how much. Volume, centroid and inertia mean something only where the body is closed — Mass::closed — and a body whose faces all point inward is measured as if they did not, which Mass::inverted says. An accuracy not positive and finite returns an Error in its Result.

Solid::oriented_box()

Result<OrientedBox> oriented_box(double accuracy = 0.0) const

This closed solid's box on its principal axes, as an OrientedBox. The axes are the inertia's, so the box is tight along a clear long direction but not the minimal box in general; where two moments are equal (a cube, a cylinder about its axis) any axes in that plane are as principal as the others, so which come back is a free choice. The half-extents are grown by the tolerance the measurement settled on, so they hold the body and may exceed its own extent by about that much. It costs as much as Solid::mass() at the same accuracy, because the axes come from the same inertia: tens of seconds at 1e-7 on a free-form body read from a file. accuracy is relative, and 0 or less asks for the box's own default, 1e-5 — not measure.default_accuracy — because a finer one buys little box: the half-extents are grown by the diagonal times the larger of accuracy and a sixteenth of the integration's tolerance, which starts at 5e-4 of the diagonal, so a body that settles at once (planes, cylinders, cones) is grown by about 3.1e-5 of its diagonal however fine the accuracy. A coarser accuracy (1e-3, say) is the fast route. An open body has no oriented box, and an accuracy that is NaN or infinite returns an Error in its Result.

Solid::edge_length()

Result<Length> edge_length(std::uint32_t edge, double accuracy = 0.0) const

The length of one edge over its own range, as a Length: edge is the index Solid::edges() uses (Python also takes the Edge itself), and accuracy the relative accuracy, 0 asking for measure.default_accuracy. An edge past the end, or one with no curve to measure, returns an Error in its Result. A body whose trims are 2D-only (Rhino .3dm, IGES entity 144) has no fillet-table edges at all, so this cannot be asked of it.

Solid::edge_point_at_length()

Result<At> edge_point_at_length(std::uint32_t edge, double s, double accuracy = 0.0) const

The point at arc length s along one edge, as an At: s is absolute, measured from the start of the edge's own range (the t0 of its Edge::curve), and lies in [0, length] — past either end by no more than the length's own error is that end, further returns an Error in its Result. edge is the index Solid::edges() uses (Python also takes the Edge itself); accuracy is relative, 0 or less asking for measure.default_accuracy. The sample's segment is empty on an edge. An edge past the end or with no exact curve, or an accuracy NaN, infinite or 1 or more, returns an Error in its Result.

Solid::edge_divide_by_count()

Result<std::vector<At>> edge_divide_by_count(std::uint32_t edge, std::uint32_t n, double accuracy = 0.0) const

One edge in n pieces of equal arc length, as a list of At: an open edge gives n + 1 samples from its start to its end, a closed one (its range the curve's whole closed loop: a whole circle or ellipse, a closed spline's whole domain) n, never its start again. The first sample is exactly the range's start and an open edge's last exactly its end. n is 1 to 1,000,000; accuracy as Solid::edge_point_at_length(), and so are the refusals.

Solid::edge_divide_by_length()

Result<std::vector<At>> edge_divide_by_length(std::uint32_t edge, double step, double accuracy = 0.0) const

Samples of one edge every step of arc length from its start, as a list of At. The last piece is whatever is left over, kept short: an open edge's end is a sample only where a step lands on it (to within the length's error), and a closed edge never repeats its start. A step longer than the edge gives the start alone. step is positive and finite and may give at most 999,999 steps; accuracy as Solid::edge_point_at_length(), and so are the refusals.

Solid::loft_curves()

static Result<Solid> loft_curves(const std::vector<NurbsCurve>& sections, std::uint32_t degree = 3, bool loose = false, bool closed = false)

A sheet lofted through sections (NurbsCurves): one face on one NURBS surface whose u runs along the sections and v across them, degree across them (lowered to what the sections allow). loose=True shapes it by the sections instead — through the first and last only, smoother between; closed=True makes it periodic across them, the last section back to the first. Fewer than two sections (three closed) returns an Error in its Result.

Solid::sweep_rail()

static Result<Solid> sweep_rail(const NurbsCurve& rail, const std::vector<NurbsCurve>& sections, const std::string& frame = "rmf", const std::optional<Vec3>& up = std::nullopt, std::optional<double> tolerance = 1e-3)

A sheet of sections swept along rail: each section carried by the rail's frame from the rail point nearest its centre, the sections between blended by their place along the rail. frame="rmf" turns the sections no more than the rail makes them (rotation-minimising); "fixed" keeps up upright, as a sweep along a car's side does. Fitted through enough stations to lie within tolerance of that definition; Solid::sheet_error() says how close it came.

Solid::sweep_two_rails()

static Result<Solid> sweep_two_rails(const NurbsCurve& rail_a, const NurbsCurve& rail_b, const std::vector<NurbsCurve>& sections, std::optional<double> tolerance = 1e-3)

A sheet of sections swept between two rails: each section's first end on rail_a and its last on rail_b, carried by the rotation and uniform scale that keep them there, the rails matched by arc length (so a section spreads as the rails do). A section whose ends are not on the rails returns an Error in its Result. Fitted within tolerance (Solid::sheet_error()).

Solid::edge_surface()

static Result<Solid> edge_surface(const std::vector<NurbsCurve>& curves, std::optional<double> tolerance = 1e-3)

The Coons sheet of 2, 3 or 4 boundary curves meeting end to end within tolerance, given in order round the boundary (each either way round): three leave the fourth side a point, two give the ruled sheet between them. Exact for non-rational boundaries; rational ones (arcs) are fitted first, and Solid::sheet_error() is that fit's error. Curves that do not meet returns an Error in its Result.

Solid::network_surface()

static Result<Solid> network_surface(const std::vector<NurbsCurve>& u_curves, const std::vector<NurbsCurve>& v_curves, std::optional<double> tolerance = 1e-3)

The Gordon sheet of a curve network: u_curves in order across one way, v_curves across the other, every one of the first crossing every one of the second within tolerance. The curves are re-fitted so their crossings share parameters, then blended; Solid::sheet_error() is the largest distance from the sheet to the curves given. A pair that does not cross returns an Error in its Result, naming both.

Solid::continuity()

Result<Continuity> continuity(const std::string& side, const Solid& other, const std::string& other_side, std::uint32_t face = 0, std::uint32_t other_face = 0, std::uint32_t samples = 64) const

How well this solid's face face meets other's face other_face along their sides — a side is "u0", "u1", "v0" or "v1", a boundary isocurve of the face's NURBS surface — as a Continuity: the largest gap between the sides (G0), the largest angle between their normals (G1), the largest difference of curvature across the edge (G2), each with where it is, from samples points along the first side. A face that is not NURBS, or a side that is not one of the four, returns an Error in its Result.

Solid::edge_continuity()

Result<Continuity> edge_continuity(std::uint32_t edge, std::uint32_t samples = 64) const

How well the two faces of edge edge (an Edge or its index) meet along it, as a Continuity: samples points along the edge, each projected onto both faces, and the largest gap between the two (G0), angle between the faces' normals (G1; each normal the way its face faces, so a square crease reads pi/2) and difference of their normal curvatures across the edge (G2), each with where it is. Any two faces of one body, of any kind of surface — where Solid::continuity() compares two NURBS faces' sides. A test fails a design on these: a G1 seam reads an angle near 0, a G2 one a curvature near 0 too. An edge bounding one face, or three, returns an Error in its Result.

Solid::faired()

Result<Solid> faired(std::optional<double> tolerance = 1e-3, std::uint32_t degree = 3, std::optional<std::pair<std::uint32_t, std::uint32_t>> controls = std::nullopt, const std::vector<std::optional<std::int32_t>>& keep = {2}, const std::string& no_inflection = "", std::uint32_t face = 0) const

Face face faired, as a sheet of its own: the smoothest surface within tolerance of its NURBS surface — least squares plus its third derivatives squared, what a zebra's ripple costs, weighed as heavily as the tolerance allows — so a sheet lofted through traced sections comes back calm between them. controls none fairs on the face's own net, its degree raised to degree (3 to 7) and its spans split to a dozen each way at least, keeping a kept side exactly; (n_u, n_v) fairs on a uniform net that size, its kept sides within the tolerance. keep says what each side keeps, one level for all four or one per side ("u0", "u1", "v0", "v1"): none free to move, 0 its position, 1 the tangent plane across it, 2 its curvature too — what Solid::match() gave it. no_inflection "u", "v" or "uv" holds the isocurves along those directions from turning their curvature over. Solid::sheet_error() is the largest distance between the two surfaces. A rational face, a degree outside 3 to 7, or a tolerance no such fair is within returns an Error in its Result, the last with the nearest distance found.

keep is a std::vector<std::optional<std::int32_t>> of one level or four in side order, std::nullopt for free.

Solid::curvature_turns()

Result<CurvatureTurns> curvature_turns(std::uint32_t face = 0, std::uint32_t samples = 32) const

Where face face's Gaussian and mean curvature change sign, on a grid of samples steps each way over its surface (8 at fewest), as a CurvatureTurns: how many separate areas of each sign, and the points between opposite signs. A dome or a saddle reads one area and no turn; a sheet whose sections wobble reads several — the surface's NurbsCurve::inflections(). A face index out of range returns an Error in its Result.

Solid::highlight_kink()

Result<HighlightKink> highlight_kink(std::uint32_t edge, std::uint32_t samples = 64) const

The worst kink of the highlight lines crossing edge edge (an Edge or its index), at samples points along it, as a HighlightKink: the lines of straight light tubes a body's size away from the surface, every tube direction tried. They run on through an edge where the two faces' curvatures agree (G2) and kink where it jumps — a fillet's seam beside a flat face. Beside Solid::edge_continuity()'s curvature jump, this is the number a zebra shows. An edge bounding one face, or three, returns an Error in its Result.

Solid::face_point()

Result<FacePoint> face_point(std::uint32_t face, const Vec3& p, std::optional<double> tolerance = std::nullopt) const

Where point p lies against face face, as a FacePoint: its nearest point of the face (exact, inside the trims or on their boundary) and where — inside, on the boundary (on an edge or a vertex of the face, or within tolerance of one) or off (farther than tolerance). Fusion's isPointOnFace is "not off"; Rhino's IsPointOnFace the same three. tolerance none (or 0) is the solid's cadaclysm::blacksmith::effective_tolerance(). A face out of range, a point not finite or a tolerance negative or infinite returns an Error in its Result.

Solid::face_inner_point()

Result<FacePoint> face_inner_point(std::uint32_t face) const

A point strictly inside face face's trims, on its surface, as a FacePoint (inside, distance 0) — Fusion's pointOnFace. A face out of range, or one where no point inside is found, returns an Error in its Result.

Solid::edge_point()

Result<EdgePoint> edge_point(std::uint32_t edge, const Vec3& p, std::optional<double> tolerance = std::nullopt) const

The nearest point to p of edge edge (an Edge or its index) on its own curve over its range, as an EdgePoint: the point, the curve's parameter t there (as Solid::edge_closest_point()'s) and on where it is within tolerance (none: the solid's cadaclysm::blacksmith::effective_tolerance()). An edge out of range, a point not finite or a tolerance negative or infinite returns an Error in its Result.

Solid::edge_inner_point()

Result<EdgePoint> edge_inner_point(std::uint32_t edge) const

A point on edge edge: its curve at the middle of its range (a whole circle half a turn from its start), as an EdgePoint — Fusion's pointOnEdge. An edge out of range returns an Error in its Result.

Solid::face_size()

Result<Vec2> face_size(std::uint32_t face) const

The width and height of the rectangle face face would flatten to — Rhino's GetSurfaceSize: over the uv box its trims span, the longest of five u-isocurves and the longest of five v-isocurves. A face out of range returns an Error in its Result.

Solid::edge_convexity()

Result<EdgeConvexity> edge_convexity(std::uint32_t edge, std::optional<double> angular_tolerance = std::nullopt, std::uint32_t samples = 16) const

How edge edge's two faces meet along it, at samples points (16 at fewest), as an EdgeConvexity: smooth (within angular_tolerance of tangent everywhere), convex (a ridge), concave (a valley), mixed (both along it) or open (one face, or three and more), with the smallest and largest signed turn between the faces' normals. angular_tolerance none (or 0) is the angle the solid declares, else the option tolerance.angular (see cadaclysm::blacksmith::set_option()). An edge out of range, or an angular tolerance negative, infinite or not below a right angle, returns an Error in its Result.

Solid::edges_convexity()

Result<std::vector<std::string>> edges_convexity(std::optional<double> angular_tolerance = std::nullopt) const

Every edge's convexity kind (as Solid::edge_convexity()'s, at 16 samples), in the order of Solid::edges().

Solid::concave_edges()

Result<std::vector<std::uint32_t>> concave_edges(std::optional<double> angular_tolerance = std::nullopt) const

The indices of the edges whose faces meet concave all along — Fusion's concaveEdges.

Solid::convex_edges()

Result<std::vector<std::uint32_t>> convex_edges(std::optional<double> angular_tolerance = std::nullopt) const

The indices of the edges whose faces meet convex all along — Fusion's convexEdges.

Solid::tangent_faces()

Result<std::vector<std::uint32_t>> tangent_faces(std::uint32_t face, std::optional<double> angular_tolerance = std::nullopt) const

Face face and every face reached from it across edges whose faces meet smoothly (Solid::edge_convexity() smooth at angular_tolerance): breadth first, the face first, then each face's new neighbours ascending — Fusion's tangentiallyConnectedFaces. A face out of range returns an Error in its Result.

Solid::tangent_edges()

Result<std::vector<std::uint32_t>> tangent_edges(std::uint32_t edge, std::optional<double> angular_tolerance = std::nullopt) const

Edge edge and every edge reached from it through vertices where two edges' curves run on with the same tangent, in the order found (the edge first) — Fusion's tangentiallyConnectedEdges. An edge out of range returns an Error in its Result.

Solid::tangent_face_groups()

Result<std::vector<std::vector<std::uint32_t>>> tangent_face_groups(std::optional<double> angular_tolerance = std::nullopt) const

The faces in groups joined smoothly (as Solid::tangent_faces()), each group's faces ascending, the groups in the order of their lowest face — Rhino's GetTangentConnectedComponents, as face groups.

Solid::angle_to()

Result<Angle> angle_to(const std::string& kind, std::uint32_t index, const Solid& other, const std::string& other_kind, std::uint32_t other_index) const

The angle between this solid's face or edge index and other's (other may be this solid), as an Angle: a planar face is read as its plane, a cylinder's, cone's or revolved face as its axis, a straight edge as its line, a circular edge as its circle's plane — Fusion's measureAngle. Two planes read the angle between their outward normals (0 to pi), two lines between their directions (0 to pi), a line and a plane the line's angle to the plane (0 to pi/2). Any other face or edge, or an index out of range, returns an Error in its Result.

Solid::face_minimum_radius()

Result<MinimumRadius> face_minimum_radius(std::uint32_t face, std::uint32_t samples = 16) const

Face face's smallest radius of curvature, 1 / max(|k1|, |k2|), as a MinimumRadius: a plane infinite, a cylinder or a sphere its radius, a cone and a torus in closed form over the face's trims, any other face on a grid of samples steps each way (16 at fewest) polished at its tightest — Fusion's MinimumRadiusAnalyses. A face out of range returns an Error in its Result.

Solid::match()

Result<Solid> match(const std::string& side, const Solid& other, const std::string& other_side, std::uint32_t level = 2, std::uint32_t face = 0, std::uint32_t other_face = 0) const

Face face as a sheet of its own, its side side bent to meet other's other_side at Glevel: 0 onto the other side, 1 into its tangent plane, 2 with its curvature too. The opposite side stays where it was; the face is refined across the edge first if it has too few rows. Both faces non-rational NURBS: a rational one, or a level outside 0 to 2, returns an Error in its Result.

Solid::fillet_surfaces()

static Result<SurfaceFillet> fillet_surfaces(const Solid& a, const Solid& b, double radius, std::optional<double> radius_end = std::nullopt, bool flip_a = false, bool flip_b = false, std::optional<double> tolerance = 1e-3, std::uint32_t face_a = 0, std::uint32_t face_b = 0)

The rolling-ball fillet between a's face face_a and b's face face_b — their whole NURBS surfaces — as (fillet, rail_a, rail_b): the fillet sheet (its Solid::sheet_error() set) and the NurbsCurves the ball touches each face along, to trim the faces back with Solid::trim_by_curve() and join the three with Solid::join_sheets(). The ball sits on the side each face's normal points to (flip_a, flip_b turn it to the other side); its radius is radius, or runs linearly from radius at the fillet's first end to radius_end at its last. A radius not positive, or sides where the ball cannot touch both faces, returns an Error in its Result.

Solid::blend_sides()

static Result<Solid> blend_sides(const Solid& a, const std::string& side_a, const Solid& b, const std::string& side_b, std::uint32_t level = 2, double bulge = 1.0, std::uint32_t face_a = 0, std::uint32_t face_b = 0)

A sheet spanning from a's side side_a to b's side side_b, meeting each at Glevel (1 a cubic across, 2 a quintic, matching curvature too); bulge scales how far it leaves each edge along its neighbour's tangent. Both faces non-rational NURBS.

Solid::n_sided_patch()

static Result<Solid> n_sided_patch(const std::vector<PatchBoundary>& boundaries, double bulge = 1.0, std::optional<double> tolerance = 0.01)

The sheet filling a hole of three or more sides — where several character lines meet, which four-sided patches cannot close: N four-sided NURBS faces round a central point, one per corner, meeting each other at G1 or G2. Each of boundaries, in order round the hole and either way round, is a sheet's side met at G2, (sheet, side); (sheet, side, level) with level 0, 1 or 2; a dict with sheet, side and any of level, face and range ((from, to) of the side's parameter: (0, 1) the whole side, (1, 0) the whole side backwards); or a NurbsCurve, met at G0. A side is "u0", "u1", "v0" or "v1". The boundaries must meet end to end within tolerance; bulge scales how far the patch leaves each neighbour along its own tangent. Face i meets boundary i's second half along its "v0" side and boundary i + 1's first half along its "u1", so Solid::continuity() measures each neighbour; Solid::patch_report() holds the worst of them. It joins its neighbours with Solid::join_sheets(). Fewer than three boundaries, ends that do not meet, two boundaries running on tangent through a corner, or a rational boundary returns an Error in its Result.

Solid::patch_report()

const std::optional<PatchReport>& patch_report() const noexcept

On a sheet from Solid::n_sided_patch(), the PatchReport of how well it meets; std::nullopt on every other solid.

Solid::sheet_error()

const std::optional<double>& sheet_error() const noexcept

On a sheet from Solid::sweep_rail(), Solid::sweep_two_rails(), Solid::edge_surface() or Solid::network_surface(), how far it came from its definition; std::nullopt on every other solid.

Solid::contains()

Result<std::string> contains(const Vec3& point, std::optional<double> tolerance = DEFAULT_TOLERANCE) const

Where point is relative to this closed solid: inside, outside, or on, within tolerance of its boundary — absolute, in model units (0.05 by default). The body is meshed on every call; for more than a few points build a Solid::classifier() once. An open body, a point not finite, or a tolerance not positive and finite returns an Error in its Result.

Solid::classifier()

Result<Classifier> classifier(std::optional<double> tolerance = DEFAULT_TOLERANCE) const

A Classifier for this closed solid at tolerance — absolute, in model units (0.05 by default): the body meshed once, then asked point after point. It keeps its own reference to the body, so it goes on answering after this solid is closed. An open body, or a tolerance not positive and finite, returns an Error in its Result.

Solid::closest()

Result<Closest> closest(const Solid& other, std::optional<double> tolerance = DEFAULT_TOLERANCE, const Progress& progress = {}) const

The closest points between this solid's boundary and other's, to tolerance — absolute, in model units (0.05 by default) — as a Closest; this solid is side a. Boundaries are measured, not volumes: a solid wholly inside another is the gap between their skins, not 0, and boundaries that cross are 0 apart (ask Solid::contains() for containment). progress, where the wrapper takes one, hears "meshing", "pruning" and "refining"; in the browser it is never called. A tolerance not positive and finite, or a solid with no faces, returns an Error in its Result. Whether two parts overlap, touch or lie within a clearance of each other is cadaclysm::blacksmith::clash()'s question, asked of a whole set.

Solid::closest_point()

Result<std::optional<PointFoot>> closest_point(const Vec3& p, std::optional<double> max_distance = std::nullopt, std::optional<double> tolerance = std::nullopt) const

The nearest point of this solid's boundary to p, as a PointFoot, or std::nullopt where it lies beyond max_distance (Rhino's maximumDistance). A point inside a closed body is answered by its nearest boundary point, not 0. max_distance none, NaN or infinite is no limit; a point a rounding error past it is not beyond, so 0 finds a point that lies on the body. tolerance — absolute, in model units — is unset when none, 0 or NaN, and the tolerance policy then resolves it to the solid's effective tolerance; it sizes the mesh search only: every face within reach is refined exactly, and where a nearer candidate fails to refine the mesh's answer comes back with refined false, within [d - 2/3 tolerance, d + tolerance] of the true distance d. The body is meshed on every call; for more than a few points build a Solid::projector() once. A point not finite, a negative max_distance, a negative or infinite tolerance, or a body that meshes to nothing returns an Error in its Result.

Solid::projector()

Result<Projector> projector(std::optional<double> tolerance = std::nullopt) const

A Projector for this solid at tolerance (none, 0 or NaN is unset, which the tolerance policy resolves to the solid's effective tolerance): the body meshed once, then asked Projector::closest_point() point after point, the same answers as Solid::closest_point() — a refined false answer within [d - 2/3 tolerance, d + tolerance] of the true distance d. It keeps its own reference to the body, so it goes on answering after this solid is closed. Open bodies and sheets are accepted. A negative or infinite tolerance, or a body that meshes to nothing, returns an Error in its Result.

Solid::curve_closest_points()

Result<std::optional<CurveBodyFoot>> curve_closest_points(const NurbsCurve& curve, std::optional<double> max_distance = std::nullopt, std::optional<double> tolerance = std::nullopt) const

The nearest points of curve and this solid's boundary, as a CurveBodyFoot, or std::nullopt where the body lies beyond max_distance (none, NaN or infinite: no limit). Where the curve passes through the boundary the answer is a crossing, distance exactly 0, at the earliest crossing in t. tolerance — absolute, in model units; none, 0 or NaN is unset, which the tolerance policy resolves to the solid's effective tolerance — sizes the march along the curve and the mesh search: a refined false answer is within [d - 2/3 tolerance, d + tolerance] of the true distance d. The body is meshed on every call; for more than a few curves build a Solid::projector() once and ask Projector::curve_closest_points(). A negative max_distance, a negative or infinite tolerance, a body that meshes to nothing, or a curve too long for the tolerance returns an Error in its Result.

Solid::triangle_mesh()

Result<TriangleMesh> triangle_mesh(std::optional<double> tolerance = std::nullopt) const

This solid's measuring tessellation as a TriangleMesh: the mesh the measuring queries search, within a third of tolerance of the surface — finer than the display mesh Solid::mesh() gives at the same tolerance. Answers against it are exact for the mesh, not for the body. tolerance — absolute, in model units; none, 0 or NaN is unset, which the tolerance policy resolves to the solid's effective tolerance. The mesh is a copy: it answers on after this solid is closed. A negative or infinite tolerance, or a body that meshes to nothing, returns an Error in its Result.

Solid::face_surface()

Result<NurbsSurface> face_surface(std::uint32_t face) const

Face face's surface (its row in the face table), its trims ignored, as an exact NurbsSurface: a NURBS face as it is (clamped if it came unclamped); a cylinder, cone, sphere or torus in its exact rational form over a parameter range that covers the face (never smaller, but for a rare holed tube face); a plane as the bilinear patch over the rectangle its trims span. (u, v) are the NURBS's own parameters. The surface is a copy: it answers on after this solid is closed. A face out of range or a surface with no exact NURBS form returns an Error in its Result.

Solid::face_closest_point()

Result<PointFoot> face_closest_point(std::uint32_t face, const Vec3& p) const

The nearest point to p of face face alone, inside its trims or on its boundary, as a PointFoot: exact, with no mesh, so always refined. A foot on the face's boundary names the edge or vertex it lies on. A face past the end (face_closest_point: face 99 of 6), a point not finite, or a face that gives no point returns an Error in its Result.

Solid::edge_closest_point()

Result<EdgeFoot> edge_closest_point(std::uint32_t edge, const Vec3& p) const

The nearest point to p of one edge, on its own curve over its range: (t, point, distance), t the curve's parameter as Edge::curve and Solid::edge_point_at_length() use it. edge is the index Solid::edges() uses — a PointFoot's edge (Python also takes the Edge itself). Exact, with no mesh. An edge past the end, one with no exact curve, or a point not finite returns an Error in its Result.

Solid::thickness_at_face()

Result<std::optional<FaceThickness>> thickness_at_face(std::uint32_t face, double maximum, std::optional<double> tolerance = THICKNESS_TOLERANCE) const
Result<std::optional<FaceThickness>> thickness_at_face(std::uint32_t face, const std::optional<Vec3>& at, double maximum, std::optional<double> tolerance = THICKNESS_TOLERANCE) const

How thick this solid's walls are at face face, as a FaceThickness, on a ThicknessGauge of this solid alone built at tolerance (0.01 by default), asked ThicknessGauge::thickness_at_face() once and freed: at at's foot on the face, or with no at over the face's vertices. maximum has no default. std::nullopt where nothing on the face reads within maximum, or at's foot lies off the face. A face past the end, an at not finite, maximum not positive and finite, or a tolerance not positive and finite returns an Error in its Result.

Solid::bounds_box()

Result<Box> bounds_box(std::optional<double> tolerance = DEFAULT_TOLERANCE) const

This solid's Box at tolerance (0.05 by default): its boolean mesh, padded by twice that — the broad phase's own bound, cheaper to move and to test against another than the solid itself. Collider builds one of these per part at construction. A tolerance not positive and finite, or a solid that meshes to nothing, returns an Error in its Result.

Solid::face_tree()

Result<RTree> face_tree() const

An RTree over this solid's faces: one entry per face, its id the face index the other face calls take, its box holding the face — the box the boolean's broad phase pairs faces by (an analytic face's exact bound, another face's boolean mesh padded), grown by a thousandth of the solid's extent. Ask it which faces a box meets, which a ray passes, or which are near a point, then test those faces themselves. A solid with no faces gives an empty tree; a face that cannot be boxed returns an Error in its Result.

Naming

Solid::named()

Result<Solid> named(std::string_view name) const

This solid, named name. The name rides through an operation with exactly one source solid (place, translate, rotate, mirror, scaled, coloured, edges_coloured, fillet, chamfer, shell, thicken, face_sheet, drop_faces, lump, trim, split_by_plane, split_by_profile, push_pull, and so on) and is dropped by one with two or more sources (join, cut, common, split_sheet, split) and by a fresh primitive or sweep. It is what Assembly::place_solid() defaults a placement's own name to, and the product name a lone named solid gets written into STEP (Solid::step()/Solid::step_text() — SAT and OCCT .brep have no product name to set). An empty name returns an Error in its Result.

Solid::name()

std::optional<std::string> name() const

This solid's name, or none, as Solid::named() set it, kept or dropped by whatever built this solid.

Material and outside style

Solid::with_material()

Result<Solid> with_material(std::string_view material) const

This solid made of material — a name, written into STEP as the product's MATERIAL_DESIGNATION. Kept by every operation as the solid's colour is: a move keeps it, and a boolean's result is made of its first solid's. Writing it moves Solid::step()'s default schema to AP242; a named schema without the entity writes the solid without it, as it does a colour. A reader takes it back as the node's Material property. A blank material returns an Error in its Result.

Solid::material()

std::optional<std::string> material() const

What this solid is made of, or none, as Solid::with_material() set it.

Solid::style()

Result<Solid> style(std::optional<std::string_view> location, std::optional<std::string_view> identification) const

This solid drawn in a style defined outside the file: identification the style's name in the library at location — a MaterialX or MDL file and a material in it, say. Either may be left out, not both. Written into STEP as an EXTERNALLY_DEFINED_STYLE beside the solid's colour, which a reader without the library draws instead (AP242 or AP214: the default schema moves to AP242); a reader takes it back as the node's ExternalStyle.Location and ExternalStyle.Identification properties. Kept by operations as Solid::with_material()'s material is. A style naming neither returns an Error in its Result.

Solid::style_location()

std::optional<std::string> style_location() const

Where this solid's outside style lives (Solid::style()'s location), or none.

Solid::style_identification()

std::optional<std::string> style_identification() const

This solid's outside style's name in its library (Solid::style()'s identification), or none.

Ids and history

Solid::track()

Result<Solid> track() const

This solid tracked: its faces numbered 1 to n in face order and its edges 1 to m in Solid::edges()' order, each its own origin. Tracking rides on from here: a verb on a tracked solid gives a tracked result, each face keeping the id of the input face it lies on and naming that face as its origin. Tracking is opt-in because it is not free: after every verb the result's faces are matched to the inputs' faces, which measured on some 2,400 real bodies costs 47% (a split) to 287% (a fillet) of the verb's own time at the median. An untracked solid pays nothing. A tracked solid comes back as it is.

Solid::is_tracked()

Result<bool> is_tracked() const

Whether this solid carries face and edge ids: it was Solid::track(), made from a tracked solid, or given an attribute.

Solid::face_id()

Result<std::optional<std::uint64_t>> face_id(std::uint32_t f) const

Face face's id, std::nullopt where this solid is untracked. An id stays with its face through every verb that keeps the face — a move, a boolean, a fillet of another edge — so it names "the same face, through my edits" within a session. A piece split off, a later operand's face whose id an earlier one already has, and a face on no input get fresh ids, the same run after run.

Ids and references answer different questions. Ids are not written to files and mean nothing on a model built again from scratch or read back: there, find a face by what it is with Solid::face_ref() and Solid::find_face() (an edge with Solid::edge_ref(), a vertex with Solid::vertex_ref()). A face the solid does not have returns an Error in its Result.

Solid::face_with_id()

Result<std::optional<std::uint32_t>> face_with_id(std::uint64_t id) const

The face whose id is id, std::nullopt where no face has it — an untracked solid, or a face a verb deleted.

Solid::face_origins()

Result<std::vector<IdOrigin>> face_origins(std::uint32_t f) const

The input faces face face came from, as (operand, id) pairs: the operand the input's index in the verb's operand order (a boolean's target 0, its tool 1), the id that input face's Solid::face_id(). The face it lies on most comes first. Empty for a face the verb generated (a fillet's round, the faces a split cuts) and on an untracked solid; more than one for a face merged from several (a join with merge). A face the solid does not have returns an Error in its Result.

Each origin is an IdOrigin, a std::pair<std::uint32_t, std::uint64_t> of (operand, id).

Solid::edge_id()

Result<std::optional<std::uint64_t>> edge_id(std::uint32_t e) const

Edge edge's id (an index into Solid::edges()), as Solid::face_id().

Solid::edge_with_id()

Result<std::optional<std::uint32_t>> edge_with_id(std::uint64_t id) const

The edge whose id is id, std::nullopt where no edge has it.

Solid::edge_origins()

Result<std::vector<IdOrigin>> edge_origins(std::uint32_t e) const

The input edge edge edge lies on, as Solid::face_origins(): one (operand, id), or none for a new edge. Edges merged from several are not seen.

Solid::history()

Result<History> history(const Solids& inputs) const

What the verb that made this solid did to the faces of inputs, passed in its operand order (a.cut(b).history(a, b)), as a History: which input faces were kept, modified (split, merged or renumbered), or deleted, and which faces were generated. Read off this solid's ids and origins alone, so it costs no geometry. An untracked solid or input, or an origin naming an operand past the inputs, returns an Error in its Result.

inputs is a Solids list: a.cut(b)->history({a, b}).

Solid::edge_history()

Result<History> edge_history(const Solids& inputs) const

Solid::history() for the edges, by edge id.

Attributes

Solid::attributes()

Result<std::map<std::string, std::string>> attributes() const

This solid's attributes: text keys and values, read-only, in key order. A solid's attributes go with it through every verb (a verb's result takes its first operand's), and they are the only attributes written to files: Solid::step() writes them as STEP user-defined attributes. Face attributes stay in memory.

Solid::attribute()

Result<std::optional<std::string>> attribute(std::string_view key) const

Attribute key, std::nullopt where this solid has none.

Solid::with_attribute()

Result<Solid> with_attribute(std::string_view key, std::string_view value) const

This solid with attribute key set to value, over any it had: a new solid, tracked if this one was not. Keys and values are text with no NUL; an empty key returns an Error in its Result.

Solid::with_attributes()

Result<Solid> with_attributes(const std::map<std::string, std::string>& attributes) const

This solid with every attribute given set, in key order.

A std::map<std::string, std::string>, so already in key order.

Solid::without_attribute()

Result<Solid> without_attribute(std::string_view key) const

This solid without attribute key: a new solid, equal to this one where it had none.

Solid::face_attributes()

Result<std::map<std::string, std::string>> face_attributes(std::uint32_t f) const

Face face's attributes, read-only, in key order. A face's attributes follow its id: kept through a verb, and copied to every face that names it as an origin, so each piece of a split face has its parent's. They stay in memory: no file carries them. A face the solid does not have returns an Error in its Result.

Solid::face_attribute()

Result<std::optional<std::string>> face_attribute(std::uint32_t f, std::string_view key) const

Face face's attribute key, std::nullopt where it has none.

Solid::with_face_attribute()

Result<Solid> with_face_attribute(std::uint32_t f, std::string_view key, std::string_view value) const

This solid with face face's attribute key set to value: a new solid, tracked if this one was not. Refused as Solid::with_attribute() is, and for a face the solid does not have.

Solid::with_face_attributes()

Result<Solid> with_face_attributes(std::uint32_t f, const std::map<std::string, std::string>& attributes) const

This solid with every attribute given set on face face, in key order.

A std::map<std::string, std::string>, as with_attributes.

Solid::without_face_attribute()

Result<Solid> without_face_attribute(std::uint32_t f, std::string_view key) const

This solid without face face's attribute key: a new solid, equal to this one where the face had none.

Edge and vertex references

Solid::edge_ref()

Result<std::array<double, 15>> edge_ref(std::uint32_t e) const

Edge edge (an index into Solid::edges()) by what it is, fifteen numbers: its kind (line 0, circle 1, ellipse 2, B-spline 3, other 4), its midpoint (x, y, z), its unit tangent there (x, y, z), its length, the outward normals there of the two faces meeting on it (x, y, z each; an open sheet's rim gives its one face's twice), and its span — how far from the midpoint Solid::find_edge() may look on a resized solid. Solid::face_ref()'s twin, for a feature made on an edge: unlike an id it survives a rebuild. An edge past the table, or one with no length, returns an Error in its Result.

Solid::find_edge()

Result<std::optional<std::uint32_t>> find_edge(const std::array<double, 15>& ref, std::optional<double> tolerance = 1e-3) const

The edge a reference from Solid::edge_ref() refers to: of the edges of that kind passing within tolerance of its midpoint and running the same way, the one of nearest length; where none does (the solid was resized), the edge of that kind running the same way between faces facing the same two ways — the only one, or the one clearly nearest, no farther than the span. std::nullopt where the edge is gone. A malformed reference, or a tolerance not positive, returns an Error in its Result.

Solid::vertex_count()

Result<std::uint32_t> vertex_count() const

How many vertices this solid has: its edges' ends, welded, in the order Solid::vertex_ref() and Solid::find_vertex() index.

Solid::vertex_ref()

Result<Vec3> vertex_ref(std::uint32_t v) const

Vertex vertex by where it is: (x, y, z). A vertex the solid does not have returns an Error in its Result.

Solid::find_vertex()

Result<std::optional<std::uint32_t>> find_vertex(const Vec3& ref, std::optional<double> tolerance = 1e-3) const

The vertex nearest vertex_ref — a Solid::vertex_ref(), or any point picked — within tolerance; std::nullopt where no vertex is that near. A point that is not three finite numbers, or a tolerance not positive, returns an Error in its Result.

Colour

Solid::coloured()

Result<Solid> coloured(const Vec3& rgb_value, std::optional<std::uint32_t> f = std::nullopt) const
Result<Solid> coloured(std::string_view colour, std::optional<std::uint32_t> f = std::nullopt) const

A new solid coloured (r, g, b), each 0..1, "#rgb", "#rrggbb" or a CSS colour name — or, given a face (Go: ColouredFace), just that face, whose colour then wins over the solid's. What is made from a coloured solid inherits: a move keeps every colour; a boolean, fillet, chamfer or shell gives each face the colour of the input face it lies on (a cut's bore takes the tool's), and a new face — a round, a shell's inner wall — the solid's. Solid::step() and cadaclysm::blacksmith::write_step() write the colours as STEP styling (AP242; a named schema that lacks styling writes the solids bare), and a solid's colour reads back as Node::colour().

Takes a Vec3 or, as a std::string_view overload, colour text, and an optional face.

Solid::colour()

Result<std::optional<Vec3>> colour() const

The solid's own colour as (r, g, b), or none.

Solid::face_colour()

Result<std::optional<Vec3>> face_colour(std::uint32_t f) const

A face's colour as drawn: its own, else the solid's, else none.

Solid::edges_coloured()

Result<Solid> edges_coloured(const Vec3& rgb_value, std::optional<std::vector<std::uint32_t>> edge_indices = std::nullopt) const
Result<Solid> edges_coloured(std::string_view colour, std::optional<std::vector<std::uint32_t>> edge_indices = std::nullopt) const

A new solid with its edges coloured (r, g, b), "#rgb", "#rrggbb" or a CSS colour name: every edge, or, given edges (as Solid::fillet() takes them: Edge records or indices), just those, whose colour then wins over the all-edges one — an empty list colours none. Inherited as face colours are: a move keeps every edge colour; a boolean, fillet, chamfer or shell gives each edge the colour of the input edge it lies on, and a new edge (a cut's rim, a round's edges) the all-edges colour. Solid::step() and cadaclysm::blacksmith::write_step() write them as STEP CURVE_STYLE styling, which the reader reads back as Node::edge_colours().

edges_coloured(Vec3, ...) takes numbers; a std::string_view overload takes colour text.

Solid::edge_colour()

Result<std::optional<Vec3>> edge_colour(std::uint32_t e) const

An edge's colour as drawn: its own, else the solid's edge colour, else none.

Solid::brep()

Result<void> brep(const std::string& path) const

Write this solid as an OCCT .brep file; see cadaclysm::blacksmith::write_brep().

Solid::document_body()

Result<std::string> document_body() const

This solid as a Document's solid.body node holds it: the kernel's own B-rep as a record of its tables (surfaces, curves, trims, loops, faces), every number as it is, and its colours (the solid's, each face's and each edge's), so the node gives back exactly this solid, drawn as it was. What Document::add_solid() puts in a document.

Solid::brep_text()

Result<std::string> brep_text() const

The same .brep file as text.

From files

Solid::open()

static Result<Solid> open(const std::string& path, std::optional<std::size_t> body = std::nullopt)

The body a CAD file holds, as a solid: STEP (AP203/214/242), ACIS .sat, Rhino .3dm, OCCT .brep, IGES, IFC or OpenSCAD (an exact B-rep where the reader carries the kernel), read where it draws, in the file's own units and axes. A file drawing several bodies needs body (0-based, in drawing order) or Solid::open_all(). What such a solid can do is what its geometry allows: fillet and chamfer want line and circle edges; booleans take any surface, but new edges traced on a free-form face are not always writable back to STEP; and every verb meshes its operands first, so its cost grows with the body's face count. Reads through the reader library, which must be from the same release.

Solid::open_all()

static Result<std::vector<Solid>> open_all(const std::string& path)

Every body a CAD file draws, as solids placed where it draws them: one per placement, so a part placed twice is two solids.

Solid::from_node()

static Result<Solid> from_node(const cadaclysm::Node& node, bool placed = true)

The body a reader Node draws, as a solid — sharing the reader's brep (Node::brep()), not copying it; the scene can be closed first. placed (the default) puts it where the node's transform does, where its mesh draws; otherwise it keeps the node's own frame. The two modules' layouts (cadaclysm::blacksmith::brep_layout_id()) must agree, or it returns an Error in its Result.

Solid::from_mesh()

static Result<std::pair<Solid, FromMeshReport>> from_mesh(const std::vector<Vec3>& positions, const std::vector<std::array<std::uint32_t, 3>>& triangles, const FromMeshOptions& options = {})

A triangle mesh — positions (three numbers a vertex) and indices (three a triangle) — as a solid and a FromMeshReport: OCCT's BRepBuilderAPI_MakeShapeOnMesh, Rhino's Brep.CreateFromMesh, Fusion's faceted MeshConvertFeatures. Vertices within weld_tolerance are welded (default 1e-6 times the bounding-box diagonal) and every triangle edge two triangles share becomes one B-rep edge. A watertight, orientable mesh comes back as a closed solid: stray triangles reoriented to agree with their neighbours, each shell turned outward (or inward, where it lies inside another: a void), so the volume is positive. Anything else comes back as an open shell, the report saying why — its holes, boundary edges and edges three or more triangles share — rather than guessing. mode says how far the triangles are grouped. planes: neighbouring triangles whose normals agree within angle_tolerance (radians, default 1 degree) and that lie on one plane within distance_tolerance (default 1e-5 times the diagonal) become one planar face, with inner loops for holes and straight runs of its outline as single line edges, its vertices snapped onto the planes they lie on: a box's mesh is 6 faces and 12 edges, and curved regions stay faceted. prismatic (the default) merges the planes the same way and fits the curved regions with cylinders, cones, spheres and tori, what fits nothing staying faceted; it is never worse than planes, whose body comes back where its own is not closed while the mesh was, holds the mesh's volume less well, or has more faces. faceted gives one face per triangle, as OCCT. No triangles, an index out of range, a coordinate that is not finite, a negative tolerance or an unknown mode returns an Error in its Result.

Solid::from_mesh_node()

static Result<std::pair<Solid, FromMeshReport>> from_mesh_node(const cadaclysm::Node& node, const FromMeshOptions& options = {})

Solid::from_mesh() on a reader Node's triangles — a loaded STL or OBJ, or any node with a mesh — in the node's own frame, not placed. Its double-precision mesh (Node::mesh64()) is copied out first; the scene can be closed afterwards.

Output

Solid::mesh()

Result<Mesh> mesh(std::optional<double> tolerance = DEFAULT_TOLERANCE) const

Triangles at tolerance: positions, normals (three floats a vertex) and indices. In every wrapper that lends a view, views owned by a held tessellation — valid for as long as you keep the view, whatever happens to the solid: meshed again at any tolerance, closed. Rust borrows the solid for the view's lifetime instead; Node and Godot copy. A raw span, slice or buffer taken out of a view does not keep the view itself reachable in a collected language: hold the view while you read one, and copy what must outlive it. The same rule as a FEM mesh's views, for the same reason. A view pins its whole tessellation — positions, normals, indices, edges, face counts, in both precisions — until the view itself is freed or collected, whichever the language uses; for data that must outlive the view, copy() it and drop the view.

Returns a view that owns a tessellation of its own: it outlives the solid being meshed again at another tolerance and the solid's own close().

Solid::mesh64()

Result<Mesh64> mesh64(std::optional<double> tolerance = DEFAULT_TOLERANCE) const

Solid::mesh() in double precision: the same tessellation at tolerance, unnarrowed — positions and normals exact far from the origin, where Solid::mesh()'s float32 positions are not. A view owned by a held tessellation, like Solid::mesh(): valid whatever happens to the solid, in every wrapper that lends a view — Node and Godot copying instead.

Returns a view that owns a tessellation of its own, like mesh: it outlives the solid being meshed again at another tolerance and the solid's own close().

Solid::fem_mesh()

Result<FemMesh> fem_mesh(double tolerance = 0.01, double max_size = 0.0, const std::optional<Frame>& placement = std::nullopt, const Progress& progress = {}) const

This solid meshed for a solver, as a FemMesh: nodes welded by bits — two mesh points are one node only where their coordinates are the same doubles, so no tolerance ever merges two distinct points and a crack stays a crack — triangles wound outward, and every node tagged with the lowest-dimension B-rep entity it lies on.

tolerance is the chordal tolerance in model units, and it alone governs how closely the mesh follows the geometry. max_size is a size ceiling, 0 for none (curvature alone): it splits boundary segments to at most that length and lays interior stations max_size / √2 apart as a target, and it adds nodes without refining the boundary geometry — a caller that wants the rim nearer its curve lowers the tolerance, where max_size only makes the elements smaller. FemMesh::longest_edge() is what the mesh actually came to, and the figure to check.

placement is a Frame or twelve numbers — origin, x, y, z — as every frame here, and left out for the identity, a solid meshed in its own coordinates being the common case. The reader's Node::fem_mesh() takes sixteen, column-major, so a caller moving between the two reformats the placement.

A cracked solid is not a failure: it comes back with FemMesh::watertight() false and its cracks in FemMesh::open_edges() and FemMesh::folded_edges(), and nothing is welded shut to make it look sound. It returns an Error in its Result for a tolerance or size the mesher refuses, a placement that is not twelve finite and invertible numbers, a closed solid this library cannot mesh, and a solid that meshes to no triangles at all.

No unlicensed notice here: FemMesh::msh_text() and FemMesh::save_msh() print it, this library noticing on its writers rather than on its builders — where the reader library notices in its own constructor and on neither .msh call.

Solid::face_triangles()

Result<FaceTriangles> face_triangles(std::optional<double> tolerance = DEFAULT_TOLERANCE) const

How many triangles each face meshed to at tolerance, one count per face in face order: the triangles of Solid::mesh() at the same tolerance run face by face, so face f's are the counts[f] after the first counts[:f].sum(), and the counts sum to the mesh's triangle count. What a viewer colours a face by. A view, like Solid::mesh() — a copy in Node and Godot.

Returns a view that owns a tessellation of its own, like mesh; copy() for counts that must outlive it.

Solid::edge_polylines()

Result<EdgePolylines> edge_polylines(std::optional<double> tolerance = DEFAULT_TOLERANCE) const

The feature edges as polylines at tolerance, one run of points per edge. Views, like Solid::mesh() — copies in Node and Godot.

Solid::edge_polyline_colours()

Result<std::vector<std::optional<Vec3>>> edge_polyline_colours(std::optional<double> tolerance = DEFAULT_TOLERANCE) const

A colour per polyline of Solid::edge_polylines() at the same tolerance, as drawn: (r, g, b), or none for a polyline on no coloured edge; an empty list where the solid has no edge paint at all — what a viewer colours the edge lines by. Copied out, unlike the polylines.

Solid::show()

Result<void> show(const O& options = O{}) const

Draw the solid with the viewer in use — in a terminal, the picture is left in the scrollback. Each face keeps its own colour (Solid::face_colour(): a colour of its own, else the solid's). Keywords: view= (front, back, left, right, top, bottom, iso), az=, el=, zoom=, up=, edges=, width=, height=, hint=, tolerance=. With the GPU library (import cadaclysm.view.wgpu) the drawing replaces what one shared window shows and stays live — at the REPL, in IPython and in Jupyter by themselves, in a script until it exits; cadaclysm.view.View draws several items or several windows.

Takes a cadaclysm::ShowOptions (edges true by default, azimuth/elevation/up std::optional; tolerance is a std::optional<double>). Blocks until the window is closed on the wgpu library (cadaclysm::view::use_wgpu()); the terminal prints a still. Several items, text labels (View::show_text) or a window that stays: cadaclysm::View. A member template: #include <cadaclysm/view.hpp> to call it, and link cadaclysm::view_loader (cadaclysm::view is the linked C library, for hosts that call cadaclysm_view.h directly).

Solid::view()

auto view(const O& options = O{}) const

Orbit the solid with the viewer in use until it is closed; returns the camera where it was left — a dict of eye, target, up, orthographic, azimuth and elevation — and pick, what was last clicked (item, node, face) or None. Keywords as Solid::show(). A fresh window, run until closed, with the GPU library.

Takes the options show does; returns a Result<Camera>.

Solid::step()

Result<void> step(const std::string& path, const std::optional<std::string>& schema = std::nullopt, Unit unit = Unit::millimetre) const

Write this solid as a STEP file (AP203, or AP242 when coloured); see cadaclysm::blacksmith::write_step() for schema and unit.

Solid::step_text()

Result<std::string> step_text(const std::optional<std::string>& schema = std::nullopt, Unit unit = Unit::millimetre) const

The same STEP file as text.

Solid::sat()

Result<void> sat(const std::string& path, Unit unit = Unit::millimetre) const

Write this solid as an ACIS SAT file; see cadaclysm::blacksmith::write_sat() for unit.

Solid::sat_text()

Result<std::string> sat_text(Unit unit = Unit::millimetre) const

The same SAT file as text.

Solid::write_3dm()

Result<void> write_3dm(const std::string& path, Unit unit = Unit::millimetre) const

Write this solid as a Rhino .3dm; see cadaclysm::blacksmith::write_3dm() for what it carries and unit.

Solid::rhino3dm_bytes()

Result<std::vector<std::uint8_t>> rhino3dm_bytes(Unit unit = Unit::millimetre) const

The same .3dm file as bytes.

Solid::svg()

Result<void> svg(const std::string& path, const SvgOptions& options = SvgOptions()) const

This solid's wireframe as SVG, from a camera the keywords describe — cadaclysm::blacksmith::write_svg()'s own words, read by the library itself rather than a viewer. With path, writes the file and returns std::nullopt; without, returns the SVG text. returns an Error in its Result on a refused option or a failed write.

Solid::silhouette_beziers()

Result<BeziersData64> silhouette_beziers(const SvgOptions& options = SvgOptions()) const

This solid's silhouette — the curves where its surfaces turn away from the eye, which no edge of it lies on, so a sphere has an outline here that its wireframe has none of — as rational cubic Béziers in double precision, from the camera the options describe: Solid::svg()'s own words, so the words that draw a picture ask about the same eye. tolerance is read as a fraction of the page's width, and nothing else in the options changes the curves; the line-set flags are not read. Exact Béziers where the surface has a closed silhouette form — sphere, cylinder, cone, extrusion — and for every other surface, a torus and a NURBS patch included, a straight-chord polyline carried as degree-1 Béziers: there is no spline fitter here, so a sphere's rim arrives as arcs and a torus's as chords.

The curves are in memory of the wrapper's own: the library's buffer is copied out and released before the call returns, so there is nothing to free and nothing that can dangle. A solid with no silhouette — one whose every face is planar, a cuboid's, since a plane has none from any eye — is an empty answer (count 0), not an error. The library clears its error slot as each call starts, so an empty answer leaves no message and a refusal leaves one; that is how the two are told apart, and why a failure from an earlier call cannot be mistaken for this call's empty answer. returns an Error in its Result on a refusal — a refused option, say.

Takes a const SvgOptions& (width with tolerance). Returns Result<BeziersData64>, with points, weights and count(); the empty answer is a BeziersData64 with count() 0, not an Error.

Solid.silhouette_beziers_free

Release silhouette Bézier data: the data from a silhouette_beziers call, passed with its matching count. std::nullopt is a no-op. The count must be the value that same call wrote through its own out-parameter — the buffer carries no length of its own.

A managed wrapper never exposes a manual free — it releases the buffer itself. This documents the C function.

Solid::to_scene()

Result<cadaclysm::Scene> to_scene(const std::optional<std::string>& schema = std::nullopt) const

This solid as a reader Scene, through STEP in memory: the door from the kernel to everything the reader does — its tree, meshes, glTF/OBJ/STL export. Needs the reader library as well.

Solid::close()

void close() noexcept

Free the solid now. The garbage collector, or the language's scope, does it otherwise.

AxisLine and Keep C++ only

using AxisLine = std::array<Vec3, 2>
enum class Keep
outside
inside

An axis is {{px, py, pz}, {dx, dy, dz}}: a point and a direction. Solid::trim() keeps the side Keep names.

Progress C++ only

using Progress = std::function<void(std::string_view phase, std::size_t done, std::size_t total)>

What the long operations — the booleans, Solid::fillet(), Solid::shell(), Solid::split() — call with a phase name and a done/total count, when one is passed.

Assembly

class Assembly

A mutable tree of placements: a name, and zero or more solids or other assemblies placed in it at a frame. Unlike Solid, placing shares rather than copies — placing one assembly under another does not snapshot it, so a later placement on the shared one shows up wherever it already sits. Close it when done, or let the language's scope do it; see Lifetimes — closing an assembly does not free what was placed in it if that is still reachable from somewhere else.

Assembly::name()

std::string name() const

This assembly's own name, given when it was made.

Assembly::place_solid()

Result<std::string> place_solid(const Solid& s, const Frame& frame, std::optional<std::string_view> name = std::nullopt) const
Result<std::string> place_assembly(const Assembly& placed, const Frame& frame, std::optional<std::string_view> name = std::nullopt) const

Place thing (a Solid or another Assembly) at frame in this assembly, called name — or, with name left out, thing's own name (Solid::name() for a solid, "part" for an unnamed one, or the placed assembly's own name), numbered past any already taken here ("bolt", "bolt 2", ...). frame must be right-handed and orthonormal, or the call returns an Error in its Result. An explicit name already taken here returns an Error in its Result. Placing an assembly that is this one, or anywhere above this one in the tree already, returns an Error in its Result naming the cycle, since writing that out would never terminate. Returns the placement's name.

Assembly::joint()

Result<void> joint(std::string_view name, std::string_view start, std::string_view end) const

Connect this assembly's links start and end, kept in that order, as a joint called name. An empty name, a name taken by another joint here, a link this assembly does not have, a link joined to itself or a (start, end) pair already joined returns an Error in its Result; the reverse pair is a different joint.

Assembly::pair()

Result<void> pair(std::string_view joint_name, std::string_view kind, const Frame& frame, const PairOptions& options = {}) const

Give joint joint its pair: kind (one of revolute, prismatic, cylindrical, screw, spherical, spherical_with_pin, planar, universal, homokinetic, fully_constrained or unconstrained), the contact frame at rest, an optional end_frame (the frame the pair reaches at its rest values; frame itself, i.e. all-zero rest values, when left out), ranges (one entry per freedom of kind, each unbounded or a lower/upper pair; left out entirely for a kind that allows none), and pitch (required and non-zero for screw, refused for any other kind). An unknown or already-paired joint, an unknown kind, a bad pitch, ranges given where none are allowed or of the wrong length, a non-finite or inverted range, or an end_frame this kind's motion cannot reach (or reaches only outside a given range) returns an Error in its Result, and the assembly is left as it was.

Assembly::pair_with()

Result<void> pair_with(std::string_view joint_name, std::string_view kind, const Frame& frame, const PairOptions& options = {}, const std::vector<double>& params = {}) const

Assembly::pair() with the kind's own numbers, params, in place of the pitch — for the coupled pairs: kind any kind pair takes, or gear or rack_and_pinion; params [pitch] for screw, [pinion_radius] for rack_and_pinion, [radius_first, radius_second, ratio] or those plus [bevel, helical_angle] (radians) for gear — the ratio the second link's rotation over the first's, signed, so two meshing external gears have a negative one — and none for any other kind. Written as AP242's screw_pair, rack_and_pinion_pair and gear_pair (whose gear_ratio is the ratio negated); a reader Scene gives them back as Pair::kind_name() and Pair::parameters(), and posing turns a coupled joint from its driver. A wrong number of parameters, a non-finite one, a zero pitch, radius or ratio, or anything pair refuses returns an Error in its Result, and the assembly is left as it was.

Assembly::state()

Result<void> state(std::string_view name, const std::vector<StateRow>& rows) const

Add a named state: the rows (Python: a mapping, or an iterable of (joint, values) pairs) set each named joint to its values, in that joint's pair's freedom order. An empty or duplicate name, no rows, an unknown joint, a joint set twice, a joint with no pair or none of its pair's freedoms, a row of the wrong length, or a non-finite or out-of-range value returns an Error in its Result, and the assembly is left as it was.

Assembly::sequence()

Result<void> sequence(std::string_view name, const std::vector<SequenceSegment>& segments, bool seconds = false) const

Add a named motion sequence over this assembly's states: segments are (state name, parameter, interpolation) rows, the interpolation one of "undefined", "discontinuous", "synchronous" or "linear", and seconds writes the parameter's unit as the second. Closed or open is the last segment's interpolation: closed unless it is "discontinuous". An empty or duplicate name, fewer than two segments, an unknown state, a non-finite or decreasing parameter, or an unknown interpolation returns an Error in its Result, and the assembly is left as it was.

Assembly::base()

Result<void> base(std::string_view link) const

Declare this assembly's base link. link naming no link of this assembly, or a base already declared, returns an Error in its Result naming the link already there.

Assembly::pose()

Result<Assembly> pose(const std::vector<StateRow>& rows, std::optional<std::string_view> state = std::nullopt, std::optional<std::string_view> ground = std::nullopt) const

This assembly with its mechanism posed, as a new assembly; this one is left as it was. Each joint is named by its path — the placement names down the tree, then the joint's name, joined by / ("drive FL/spin"), a / or \ inside a name escaped with \ — or by its bare name, which means a joint of this assembly by that name, else the only joint of that name anywhere under it; each copy of a sub-assembly placed more than once poses on its own. Values are absolute, one per freedom of the joint's pair, radians for rotations and the assembly's units for translations. A state's path is applied first and overridden joint by joint; ground names one of this assembly's links to hold fixed (default: its base, else its busiest link). A sub-assembly no key reaches is shared with this one. An unknown or ambiguous key, a joint given twice, one without a pair, the wrong number of values, a value that is not finite or is outside its range, an unknown state or link, or a loop the pose leaves open returns an Error in its Result. Whether the parts meet on the way from one pose to the next is Assembly::swept_clash()'s question.

Assembly::parts()

Result<std::vector<std::string>> parts() const

The placement path of every solid under this assembly, at any depth: depth first, placements in order, the placement names down the tree joined by /, a / or \ inside a name escaped with \, as Assembly::pose()'s keys are ("a\/b/x" for part x of a sub-assembly placed as a/b). The index Assembly::swept_clash()'s rows use. Empty for an assembly that places no solid.

Assembly.part_placements

Where every solid under this assembly sits in the world, in Assembly::parts()' order: twelve numbers a part — origin, x axis, y axis, z axis, as every frame argument — its placement frames composed from the top down. Empty for an assembly that places no solid.

Not in this wrapper yet.

Assembly.posed_placements

Where every solid sits with the mechanism posed: what Assembly::pose() with the same arguments then Assembly.part_placements give, number for number, without making the posed assembly — the call to make once per frame of an animation. values, state and ground as Assembly::pose() takes them; every refusal of Assembly::pose() returns an Error in its Result, worded posed_placements:.

Not in this wrapper yet.

Assembly::swept_clash()

Result<std::vector<SweptClash>> swept_clash(const std::vector<std::vector<StateRow>>& keyframes, double clearance = 0.0, std::optional<double> tolerance = DEFAULT_TOLERANCE, double resolution = 1e-3, std::uint32_t max_steps = 100000, const std::vector<std::pair<std::uint32_t, std::uint32_t>>& allowed = {}, std::optional<std::string_view> ground = std::nullopt, bool joined = false) const

Every pair of this assembly's solids, indexed as Assembly::parts() lists them, that penetrates, touches or comes within clearance of the other anywhere while this assembly's own mechanism moves through keyframes, as SweptClash rows in pair order. Each keyframe maps joint keys to values as Assembly::pose()'s values do, and every keyframe names the same joints with the same number of values each (the first keyframe fixes their order); time runs in keyframe units, keyframe k at time k.

Between two keyframes each joint value moves linearly and each link is posed from those values, as Assembly::pose() poses it: a link swinging about a joint goes round its arc, not along its chord, and a coupled joint turns from its driver. Only this assembly's own joints move: a key into a sub-assembly is refused, and a sub-assembly rides the link its placement is in. ground names one of this assembly's links to hold fixed (default: its base, else its busiest link); solids in no link stay still too. Pairs on the two links a joint joins are not tested unless joined; allowed pairs of part indices are never tested. tolerance (0.05 by default) meshes the parts; the guarantee, resolution and max_steps are Collider::swept_clash()'s, and each row's first is the Clash at the posed frames, so its Clash::solid() rebuilds the contact.

Fewer than two keyframes, keyframes naming different joints or a different number of values for one, a joint given twice, a key into a sub-assembly, anything Assembly::pose() refuses of a key or its values, an unknown ground, a loop the motion leaves open, an allowed pair that is not two indices or one out of range, a part that is not a closed solid, or a bad tolerance, clearance, resolution or max_steps returns an Error in its Result; the kernel's own words are prefixed swept_clash:.

Assembly::step_text()

Result<std::string> step_text(const std::optional<std::string>& schema = std::nullopt, Unit unit = Unit::millimetre) const

This assembly, and everything placed under it, as one STEP file: this assembly the root product, each sub-assembly and each distinct part (the same solid with the same paint and name) written once, each placement an occurrence named as it was placed. schema and unit as cadaclysm::blacksmith::write_step(). An assembly reachable from this one, this one included, that places nothing returns an Error in its Result — a reader would never show it.

Assembly::step()

Result<void> step(const std::string& path, const std::optional<std::string>& schema = std::nullopt, Unit unit = Unit::millimetre) const

Assembly::step_text() written to a file.

Assembly::rhino3dm_bytes()

Result<std::vector<std::uint8_t>> rhino3dm_bytes(Unit unit = Unit::millimetre) const

This assembly, and everything placed under it, as one Rhino .3dm: each distinct part (as Assembly::step_text() counts them) a block holding its body, each sub-assembly a block of references to what it places — so nested assemblies are nested blocks — and this assembly's own placements references at the top of the file, on a layer named after it. Each reference is named as its placement was; block names are the parts' and assemblies' names made ones Rhino takes and numbered past any already taken, whatever their case. Bodies, colours and unit as cadaclysm::blacksmith::write_3dm(). An assembly reachable from this one, this one included, that places nothing returns an Error in its Result.

Assembly::write_3dm()

Result<void> write_3dm(const std::string& path, Unit unit = Unit::millimetre) const

Assembly::rhino3dm_bytes() written to a file by the library itself.

Assembly::to_scene()

Result<cadaclysm::Scene> to_scene(const std::optional<std::string>& schema = std::nullopt) const

This assembly as a reader Scene, through STEP in memory; see Solid::to_scene().

Assembly::close()

void close() noexcept

Free this handle now. The garbage collector, or the language's scope, does it otherwise.

Assembly::create C++ only

static Result<Assembly> create(std::string_view name)

Python's Assembly(name): a new, empty assembly called name, or a Result holding the refusal for an empty one.

History

struct History

What a verb did to its inputs' faces (or edges) — what Solid::history() and Solid::edge_history() return, read off the result's ids and origins alone. An input face is named (operand, id): the operand its input's index in the verb's operand order (a boolean's target 0, its tool 1), the id its Solid::face_id(). Each list is in (operand, id) order, generated in id order.

History::kept

std::vector<std::pair<IdOrigin, std::uint64_t>> kept

The inputs that became exactly one output and kept their id, each as (input, output id).

History::modified

std::vector<std::pair<IdOrigin, std::vector<std::uint64_t>>> modified

The inputs split (several outputs name them), merged (their output has other origins too) or renumbered (a cut's bore, a later operand's clashing id), each as (input, [output ids]); a split's first piece, which keeps the id, comes first.

History::generated

std::vector<std::uint64_t> generated

The outputs with no origin: a fillet's round, the faces a split cuts.

History::deleted

std::vector<IdOrigin> deleted

The inputs no output names, such as the caps of a cut's tool.

Edge

struct Edge

One edge of a solid as plain data, copied out of it: what Solid::edges() lists and Solid::fillet() takes.

A method that takes edges — Solid::fillet(), Solid::chamfer(), Solid::edges_coloured() — takes a list of them, Edge values or their indices, and refuses a single one: one edge is a list of one. So do the face and corner lists of Solid::drop_faces(), Solid::shell() and Profile::round(); Solid::push_pull() takes one face on its own or a list.

Edge::index

std::uint32_t index

Its index — what Solid::fillet() and Solid::chamfer() take.

Edge::kind

std::string kind

The curve: line, circle, ellipse, parabola, hyperbola, nurbs or other.

Edge::faces

std::vector<std::uint32_t> faces

The faces meeting on it, as face indices.

Edge::segments

std::vector<std::array<Vec3, 2>> segments

The two ends of each piece of the edge.

Edge::curve

std::optional<Curve> curve

The edge's exact curve, as a Curve — std::nullopt for an edge with no exact curve (kind other). Filled when the edges are listed, so the edge stays plain data.

Edge::is_line()

bool is_line() const

Whether the edge is straight.

Edge::direction()

std::optional<Vec3> direction() const

The unit direction of a straight edge, or std::nullopt for a curved one. Picking the vertical edges of a plate is a filter on this.

Curve

struct Curve

One edge's, or one intersection chain's, exact curve as plain data, copied out: what Edge::curve or Chain::curve holds. kind is line, circle, ellipse, parabola, hyperbola or nurbs.

t0..t1 is the edge's (or the chain's) parameter range on its own curve: a line's fraction (0..1 over origin -> origin + x, where x is the full to - from, NOT unit — so point(t) = origin + x*t); a circle's or ellipse's angle in radians about origin in the x, y plane (point(t) = origin + x*radius*cos(t) + y*radius2*sin(t), radius2 = radius for a circle); a parabola's own parameter with radius its focal length F (point(t) = origin + x*F*t*t + y*2*F*t, radius2 0); a hyperbola's with radius, radius2 its semi-axes a, b (point(t) = origin + x*a*cosh(t) + y*b*sinh(t)); a NURBS's knot parameter (knots[degree] <= t0 < t1 <= knots[n]). Frame vectors x, y, z are unit for conics; for a line x is the direction with length = the line's length and y, z are zero. Always t0 < t1: an edge whose segments run against its curve's own parameter reports the same range — read the direction from Edge::segments, not from the range. A chain's Chain::points always run WITH the curve's own parameter instead: point(t0) is the chain's first point and point(t1) its last for an open chain (a closed chain simply goes once round, t0..t1 its whole domain).

For a NURBS the frame is zero and so are the radii; for a conic or a line degree is 0 and knots, poles are empty. Evaluating point(t) is left to the caller for now.

Curve::kind

std::string kind

The curve: line, circle, ellipse, parabola, hyperbola or nurbs. Never other: a curve of that kind is std::nullopt instead.

Curve::origin

Vec3 origin

The frame's origin, three numbers: a circle's or ellipse's centre, a parabola's vertex, a hyperbola's centre, a line's start. Zero for a NURBS.

Curve::x

Vec3 x

The frame's first axis: a conic's unit direction at angle 0 (a parabola's or hyperbola's axis); for a line the whole to - from, so origin + x is its far end. Zero for a NURBS.

Curve::y

Vec3 y

The frame's second axis: a conic's unit direction at a quarter turn. Zero for a line or a NURBS.

Curve::z

Vec3 z

The frame's normal, x cross y, unit for a conic. Zero for a line or a NURBS.

Curve::radius

double radius

A circle's radius, an ellipse's along x, a parabola's focal length, a hyperbola's semi-axis along x; 0 for a line or a NURBS.

Curve::radius2

double radius2

An ellipse's radius along y, a hyperbola's semi-axis along y; equal to radius for a circle; 0 for a parabola, a line or a NURBS.

Curve::t0

double t0

Where the edge starts on the curve, in the range convention above.

Curve::t1

double t1

Where it ends: greater than t0. A whole circle is one edge, t1 - t0 a full turn. On a conic t1 may exceed 2pi when the arc crosses angle 0 (say t0 5.6, t1 7.0): keep the angles as reported and never normalise them into 0..2pi, or the arc is drawn the long way round.

Curve::degree

std::uint32_t degree

A NURBS's degree; 0 for a conic or a line.

Curve::knots

std::vector<double> knots

A NURBS's knot vector, poles + degree + 1 long; empty for a conic or a line.

Curve::poles

std::vector<Vec3> poles

A NURBS's control points, three numbers each; empty for a conic or a line.

Curve::value()

Result<std::optional<CurveValue>> value() const

This curve as a value: a line a Line from origin to origin + x; a circle a Circle over a full turn, else the Arc over t0..t1; an ellipse its whole Ellipse (the range stays here: there is no elliptical-arc value); any other kind std::nullopt.

Curve::weights

std::optional<std::vector<double>> weights

One weight per pole for a rational NURBS; std::nullopt for a plain (non-rational) B-spline, a conic or a line.

Intersection

struct Intersection

What Solid::intersect() found, copied out: chains, one Chain per face pair per branch of the crossing, and overlaps, one Overlap per coincident face pair sharing a region. Both empty where the solids do not meet.

Intersection::chains

std::vector<Chain> chains

Every crossing found, as Chain values.

Intersection::overlaps

std::vector<Overlap> overlaps

Every coincident face pair sharing a region, as Overlap values.

Chain

struct Chain

One branch of one face pair's crossing, as plain data: one of Intersection::chains. Every point is within tolerance of both faces' exact surfaces. There is one chain per face pair per branch — a chain does not cross a face boundary or a closed curve's own seam, so a crossing that runs past either comes back as more than one chain, and a caller joins them by matching ends. closed when the chain's own ends meet.

Chain::points

std::vector<Vec3> points

The points along the crossing, in walk order; a closed chain does not repeat its first point.

Chain::closed

bool closed

Whether the chain's own ends meet.

Chain::face_a

std::uint32_t face_a
std::uint32_t face_b

The two faces that cross: the index in the first solid Solid::intersect() was called on, then the index in the second.

Chain::tangent

bool tangent

Whether the two surfaces are near-tangent along the chain, or the snap did not settle within tolerance — the points are then the best estimate found, not exact to the tolerance everywhere. A closed chain that does not go once round its own curve (a sliver of mesh noise where two surfaces barely cross) is reported with no curve at all, tangent still true.

Chain::curve

std::optional<Curve> curve

The crossing's exact curve, as a Curve over the chain's own t0..t1 — std::nullopt where no curve fits every point of the chain within tolerance (tangent noise, or a crossing with no closed form).

Overlap

struct Overlap

A face of the first solid and a face of the second that coincide — lie on one surface and share a region — as plain data: one of Intersection::overlaps. A face pair sharing only an edge or a rim (no shared region: two pipes end to end, two boxes flush on a side) is silent — neither an overlap nor a chain. Two coincident planes give their exact common region — two offset boxes the rectangle they share, an L under a box the L. On a curved surface loops are the rings of either outline lying wholly inside the other face, and may come back empty where the two outlines cross: a valid answer, not an error.

Overlap::face_a

std::uint32_t face_a
std::uint32_t face_b

The two coincident faces: the index in the first solid Solid::intersect() was called on, then the index in the second.

Overlap::loops

std::vector<std::vector<Vec3>> loops

The shared region's boundary: closed rings of points on the surface, outer loop before holes, each ring's first point not repeated.

Finding

struct Finding

One thing wrong with one argument of Solid::check(), as plain data. index, other and size are what its kind gives, and std::nullopt, std::nullopt and 0 where it gives none.

Finding::kind

std::string kind

What is wrong: no_faces; open (index the edge — std::nullopt for a side naming none — other its face, size its length); region_wall; non_manifold; face_kind (index the face); short_edge (index the edge, size its length); collapsed_edge (index the trim); sliver_face (index the face, size its width); tiny_face (index the face, size its area); tiny_body (size its diagonal); small_hole (index the loop, size its area or width); loose_edge (index the edge, size how far its sides part); curve_on_surface (index the edge — a trim's index for a trim naming none — other the face, size the largest deviation); c0_inside (inside a face: index the face, other std::nullopt; along an edge's curve: index the edge, other the lowest-numbered face it bounds; size the angle, in radians); self_intersection (index and other the two faces — one face twice for a fold — size the crossing's length); self_overlap (index and other the two faces); unmeshable; and on the pair, argument 0 with index in the solid checked and other in other: merge_vertex (the two vertices, size their distance), merge_edge (the two edges, size the largest gap), merge_face (the two faces, size the largest separation), tangent_face (the two faces, size the tangent stretch's length).

Finding::argument

std::uint32_t argument

Which argument: 0 the solid Solid::check() was called on, 1 other; 0 for the four kinds on the pair.

Finding::index

std::optional<std::uint32_t> index

The vertex, edge, face, trim or loop the kind names; std::nullopt where it names none.

Finding::other

std::optional<std::uint32_t> other

The second index the kind gives (an open edge's face, the face an edge leaves or creases on, the second face of a self-intersection, other's vertex, edge or face for a kind on the pair); std::nullopt where it gives none.

Finding::size

double size

The length, width, area, gap or angle the kind gives; 0 where it gives none.

Mass

struct Mass

What a body measures, per unit density: what Solid::mass() returns. Every figure carries a bound on its own error, because a measurement without one cannot be compared with anybody else's — including another kernel's. Measured on the exact surfaces where a face has one and on a mesh where it has not, which Mass::from_mesh reports.

Mass::closed

bool closed

The body is topologically closed. Only then do the volume, the centroid and the inertia mean anything; they are not numbers at all otherwise.

Mass::inverted

bool inverted

Every face pointed inward. The figures are given as if they had not.

Mass::accuracy_met

bool accuracy_met

Every error came under the accuracy asked for. false where the refinement gave up first — the values and their errors are still honest, simply less certain.

Mass::from_mesh

bool from_mesh

Measured on a mesh rather than on exact surfaces: exact for that mesh, and its errors are then the rounding floor rather than a statement about the surface.

Mass.of

Measure solid at accuracy, which is the same call as Solid::mass() written the other way round: Mass.of(solid) where the body reads better as the object of the sentence.

Not in C++: solid.mass() is the only spelling, and a static taking a Solid would have to be declared after it.

Mass::weight()

double weight(double density) const

density * volume, in whatever units the model and the density agree on. Per unit density is what everything here is, because an assembly of two materials would have to undo a density applied on its behalf — so Mass.of(part).mass(7850) is a steel part in kilograms where the model is in metres, and the inertia scales the same way.

Spelled weight here: a member named mass on a type named Mass reads as a repetition, and this is the one figure that is not per unit density.

Mass::area

double area

The surface area.

Mass::area_error

double area_error

A bound on area's own error.

Mass::volume

double volume

The volume enclosed, where Mass::closed.

Mass::volume_error

double volume_error

A bound on volume's own error.

Mass::centroid

Vec3 centroid

The volume's centroid, where Mass::closed.

Mass::centroid_error

double centroid_error

A bound on the distance from centroid to the true centroid.

Mass::inertia

std::array<Vec3, 3> inertia

The inertia tensor about the centroid, row-major and symmetric, products of inertia negated (inertia[0][1] is minus the integral of (x - gx)(y - gy)).

Mass::inertia_error

double inertia_error

A bound on every entry of inertia.

Mass::principal_moments

Vec3 principal_moments

The tensor's eigenvalues, ascending.

Mass::principal_axes

std::array<Vec3, 3> principal_axes

Their axes, one unit vector each, in the same order.

OrientedBox

struct OrientedBox

What Solid::oriented_box() returns: a closed solid's box on its principal axes. Not the minimal box in general, and with equal moments the axes are a free choice; see Solid::oriented_box().

OrientedBox::centre

Vec3 centre

The box's middle, not the body's centroid.

OrientedBox::axes

std::array<Vec3, 3> axes

The three unit axes, one row each: orthonormal and right-handed.

OrientedBox::half

Vec3 half

The half-extent along each axis, grown by the tolerance the measurement settled on.

Length

struct Length

A measured length — what Solid::edge_length() and Profile::length() return — beside an estimate of its error. The error is an estimate of the distance from the true length, not a proof.

Length::length

double length

The length.

Length::error

double error

An estimate of how far length is from the true length.

Length::accuracy_met

bool accuracy_met

The error came under the accuracy asked for. false where the refinement stopped at its depth limit first: the figure is then less certain than was asked, and error says by how much.

Length::from_polyline

bool from_polyline

The curve was a sampled polyline: exact for its points and not for whatever they were sampled from.

LengthMass

struct LengthMass

A curve's length mass properties per unit length density — what NurbsCurve::mass() returns, as Rhino's LengthMassProperties — each figure beside an estimate of its own error. Where two principal moments agree within inertia_error, any orthonormal pair spanning their plane is as right as another.

LengthMass::length

double length

The length.

LengthMass::length_error

double length_error

An estimate of length's own error.

LengthMass::centroid

Vec3 centroid

The centroid of the curve's length.

LengthMass::centroid_error

double centroid_error

An estimate of the distance from centroid to the true centroid.

LengthMass::inertia

std::array<Vec3, 3> inertia

The inertia tensor about the centroid, three rows of three, symmetric, products of inertia negated.

LengthMass::inertia_error

double inertia_error

An estimate of every entry of inertia's error.

LengthMass::principal_moments

Vec3 principal_moments

The tensor's eigenvalues, ascending.

LengthMass::principal_axes

std::array<Vec3, 3> principal_axes

Their axes, unit and right-handed, row i the axis of moment i.

LengthMass::radii

Vec3 radii

The radius of gyration about each principal axis, sqrt(principal_moments[i] / length).

LengthMass::accuracy_met

bool accuracy_met

Every error is within the accuracy asked of its scale.

LengthMass::from_polyline

bool from_polyline

The curve was a sampled polyline: exact for its points and not for whatever they were sampled from.

SectionCurve

struct SectionCurve

One curve of Solid::section_curves() or Solid::contour_curves().

SectionCurve::curve

NurbsCurve curve

The curve, a NurbsCurve; its NurbsCurve::fit_error() is error.

SectionCurve::plane

std::uint32_t plane

The contour plane it lies in, by index; 0 for a single section.

SectionCurve::closed

bool closed

It comes back to its start.

SectionCurve::exact

bool exact

Every piece of it was an exact curve: a line, circle, ellipse or NURBS crossing, or a face's own edge.

SectionCurve::error

double error

Its fit error; 0 where exact.

NurbsCurve

class NurbsCurve

A curve in space to model with — always a NURBS, so a line, an arc or a conic is an exact rational one. NurbsCurve(points, degree=3, weights=None, knots=None) builds one from its control points (degree 1 to 7; weights positive, one per point; the full knot vector, non-decreasing, or None for clamped and uniform); NurbsCurve::through(), NurbsCurve::fit(), NurbsCurve::from_edge(), NurbsCurve::isocurve() and NurbsCurve::blend() build the rest. Immutable: every edit returns a new curve. Not Curve, the plain data an edge's curve is copied out as.

A face is its whole surface here: projecting onto, pulling to and crossing a face ignore its trims, so a curve projected past a face's edge lands on the surface's continuation. A curve projected or pulled onto a face is a 3D curve fitted through points on the surface, within the tolerance asked (NurbsCurve::fit_error() says how close it came), not a curve in the face's parameters. Every refusal names the C call, e.g. nurbs_curve_trimmed: ....

NurbsCurve::through()

static Result<NurbsCurve> through(const std::vector<Vec3>& points, std::uint32_t degree = 3, bool closed = false, const std::optional<Vec3>& start_tangent = std::nullopt, const std::optional<Vec3>& end_tangent = std::nullopt)

The curve of degree through points in order, chord-length parametrised. closed=True closes it back to the first point, smooth across the seam (C^(degree-1)); an open curve may leave along start_tangent and arrive along end_tangent (directions; their length does not matter). Too few points for the degree, a point repeating the one before it, or a closed curve given end tangents, returns an Error in its Result.

NurbsCurve::fit()

static Result<NurbsCurve> fit(const std::vector<Vec3>& points, std::uint32_t degree = 3, std::optional<double> tolerance = 1e-3)

A curve of degree within tolerance of every point, through the first and the last (least squares, growing its control points until the tolerance is met); its NurbsCurve::fit_error() is the largest distance from a point to it. A tolerance not positive returns an Error in its Result.

NurbsCurve::fair()

static Result<NurbsCurve> fair(const std::vector<Vec3>& points, std::uint32_t degree = 5, std::optional<double> tolerance = 1e-3, const std::optional<NoInflection>& no_inflection = std::nullopt)

The smoothest curve of degree (3 to 7) within tolerance of every point, through the first and the last: least squares plus the curvature's derivative squared, weighed as heavily as the tolerance allows. Where NurbsCurve::fit() follows the points' noise, this spends the tolerance on a calm curvature comb (NurbsCurve::comb()) — a design line traced off a drawing comes back fair. no_inflection=True keeps the curvature from turning over anywhere; a pair of point indices (i, j) (fractions between points, None an open end) only between those points. Its NurbsCurve::fit_error() is the largest distance from a point to it. A degree outside 3 to 7, or a hold no curve within the tolerance can keep, returns an Error in its Result.

NurbsCurve::faired()

Result<NurbsCurve> faired(std::uint32_t degree = 5, std::optional<double> tolerance = 1e-3, const std::optional<NoInflection>& no_inflection = std::nullopt) const

This curve faired: the smoothest curve of degree within tolerance of it, from its start to its end, as NurbsCurve::fair() makes one from points; the no_inflection pair is this curve's own parameters here. Its NurbsCurve::fit_error() is the largest distance found between the two.

NurbsCurve::from_edge()

static Result<NurbsCurve> from_edge(const Solid& solid, std::uint32_t edge)
static Result<NurbsCurve> from_edge(const Solid& solid, const Edge& edge)

Edge edge of solid (an Edge or its index) as an exact NURBS over the edge's own span of its curve, running the way the edge runs. An edge with no exact curve returns an Error in its Result.

NurbsCurve::isocurve()

static Result<NurbsCurve> isocurve(const Solid& solid, std::uint32_t face, bool along_u, double at)

The isocurve of face face of solid's surface: along u at v = at when along_u, else along v at u = at. NURBS faces only: a plane or a quadric face returns an Error in its Result, as does an at outside the surface's domain.

NurbsCurve::face_isocurves()

static Result<std::vector<NurbsCurve>> face_isocurves(const Solid& solid, std::uint32_t face, bool along_u, double at, std::optional<double> tolerance = std::nullopt)

The pieces of face face's isocurve of solid that lie inside its trims, as Rhino's TrimAwareIsoCurve, in order along it: along u at v = at when along_u, else along v at u = at. Exact on every surface kind (a sampled profile's falls back to a fit at tolerance, 0 or std::nullopt the solid's own); each piece's ends are polished onto the edges they meet, and its NurbsCurve::fit_error() is the larger of its fit error and those ends' distance from their edges. A periodic seam is crossed in one piece; an at the face never reaches gives an empty list. Solid::face_iso_intervals() gives the same pieces as parameter intervals.

NurbsCurve::spiral()

static Result<NurbsCurve> spiral(const AxisLine& axis, const Vec3& start, double pitch, double turns, std::optional<double> end_radius = std::nullopt)

A helix or spiral as a curve, as Rhino's NurbsCurve.CreateSpiral: about axis (a point on it and its direction, which need not be unit) from start, turning the right-hand way about the direction and climbing pitch along it each turn (negative climbs the other way, 0 is flat) for turns turns, its radius running linearly with the angle from start's distance from the axis to end_radius (std::nullopt: the same, a helix). A start on the axis takes revolve's reference direction. A C2 quintic, 16 spans a turn, through the exact spiral at every span end; its NurbsCurve::fit_error() is its largest distance from the exact spiral. An axis direction zero or not finite, turns not positive and finite, pitch not finite, or both radii zero, returns an Error in its Result.

NurbsCurve::blend()

static Result<NurbsCurve> blend(const NurbsCurve& a, bool a_end, const NurbsCurve& b, bool b_end, std::uint32_t continuity = 2, double bulge = 1.0)

The curve bridging a (at its end when a_end, else its start) to b (at its end when b_end, else its start), leaving a and arriving at b along their tangents: continuity 1 matches position and tangent (a cubic), 2 also the curvature (a quintic). bulge (positive, 1 usual) scales how far the tangents reach. Two ends at the same point returns an Error in its Result.

NurbsCurve::join()

static Result<NurbsCurve> join(const std::vector<NurbsCurve>& curves, double tolerance = 1e-6)

curves joined end to end into one curve, as Rhino's JoinCurves: in the order given, each turned where needed so its start meets the previous one's end (the first one too, when only its start meets the second), within tolerance, and the joint placed at the midpoint of the two ends. All are raised to the highest degree among them and each runs over k..k + 1 of the result, joined C0 — a corner stays a corner; a rational curve (an arc) keeps its points exactly. One curve gives a copy. No curves, or two ends further apart than tolerance, returns an Error in its Result, naming the two curves and the gap.

NurbsCurve::closest_point()

Result<CurveFoot> closest_point(const Vec3& p) const
Result<std::optional<CurveFoot>> closest_point(const Vec3& p, std::optional<double> max_distance) const

The CurveFoot nearest p over the curve's whole domain: its parameter t, the point, and unique — false where another point of the curve is as near (a point on a circle's axis) and point is a pick among them. Exact. std::nullopt where it lies beyond max_distance (none, NaN or infinite: no limit, the same answer as with none). A point not finite or a negative max_distance returns an Error in its Result.

NurbsCurve::closest_points()

Result<std::optional<CurvePair>> closest_points(const NurbsCurve& other, std::optional<double> max_distance = std::nullopt) const

The nearest points of this curve and other, as a CurvePair — side a this curve, distance 0 where they cross, and among equal distances the smallest t_a, then t_b — or std::nullopt where they lie farther apart than max_distance (none, NaN or infinite: no limit). Exact. A negative max_distance returns an Error in its Result.

NurbsCurve::closest_object()

Result<std::optional<NearestObject>> closest_object(const std::vector<NearItem>& items, std::optional<double> max_distance = std::nullopt, std::optional<double> tolerance = std::nullopt) const

The item of items nearest to this curve, as a NearestObject, or std::nullopt where none lies within max_distance (none, NaN or infinite: no limit) or items is empty. Each item is a Solid, a NurbsCurve, a Projector, a TriangleMesh or a NurbsSurface (both answered exactly) or a point. Items are asked in order, each with the best distance so far as its limit, and once one touches the curve no later one is asked; equal distances go to the earlier item. tolerance (none, 0 or NaN: each solid's effective tolerance) sizes each solid's search; a projector keeps its own, and its lock is held for the whole curve query, so other threads asking it wait. An item of none of those kinds or a point not finite (each naming item <i>), a negative max_distance, a negative or infinite tolerance, or a body's own refusal returns an Error in its Result.

NurbsCurve::tween()

Result<std::vector<NurbsCurve>> tween(const NurbsCurve& other, std::uint32_t count, const std::string& method = "matching", std::optional<std::uint32_t> samples = std::nullopt, bool align = true, std::optional<double> tolerance = std::nullopt) const

count curves blending evenly from this curve to other, as Rhino's CreateTweenCurves family: the i-th at the fraction (i + 1) / (count + 1). method says how the two are brought to one structure first. "plain" blends control point by control point and weight by weight, so the curves must already share degree, control-point count and knots (returns an Error in its Result otherwise; Rhino answers with a curve that is not a blend). "matching" makes them compatible exactly, by degree elevation and knot merging, and blends in homogeneous coordinates: rational curves stay rational, and two non-rational curves blend point for point along their parameters. "sampling" divides both into samples equal pieces by arc length, blends the samples and fits a cubic through them — the robust choice for curves of very different shape; closed curves give a periodic tween. With align (the default) other is first lined up with this curve: turned to run the same way and, for closed curves, its seam moved round to match this one's start, so the tweens do not twist. Rhino's calls leave that to the caller; align=False does the same. tolerance (None: the curves' effective tolerance) decides whether a curve is closed and how closely the samples sit at their arc lengths. One curve open and the other closed returns an Error in its Result.

NurbsCurve::project_to_plane()

Result<NurbsCurve> project_to_plane(const Vec3& origin, const Vec3& normal, const std::optional<Vec3>& direction = std::nullopt) const

This curve projected onto the plane through origin with normal, along direction (None: the normal). Exact — the control points move, the weights stay. A direction lying in the plane returns an Error in its Result.

NurbsCurve::project_to_face()

Result<NurbsCurve> project_to_face(const Solid& solid, std::uint32_t face, const Vec3& direction, std::optional<double> tolerance = 1e-3) const

This curve projected along direction onto face face of solid (its whole surface): sampled, each sample carried along the direction to the surface, fitted within tolerance. A sample whose ray misses the surface, or a result straying past the tolerance, returns an Error in its Result.

NurbsCurve::pull_to_face()

Result<NurbsCurve> pull_to_face(const Solid& solid, std::uint32_t face, std::optional<double> tolerance = 1e-3) const

This curve pulled onto face face of solid (its whole surface): each sample moved to its nearest surface point, fitted within tolerance.

NurbsCurve::offset_on_sheet()

Result<NurbsCurve> offset_on_sheet(const Solid& solid, double distance, std::optional<double> tolerance = 1e-3) const

This curve, lying on the sheet solid (any of its faces, within ten times tolerance), offset distance along it: each sample walked that far across the sheet, square to the curve — left of its run seen from the outward side for a positive distance — over the seams of a joined sheet and onto the surface continued past its edge, and fitted within tolerance, each side of a crease apart. fit_error is the larger of the fit's error and the distance off the sheet. A curve that does not lie on the sheet returns an Error in its Result.

NurbsCurve::offset()

Result<NurbsCurve> offset(double distance, const Vec3& direction, std::optional<double> tolerance = std::nullopt) const

This curve moved distance in space, square to its tangent and to direction, as Rhino's Curve.Offset: to the right of its run seen from the tip of direction for a positive distance, to the left for a negative one. A line, or a circular arc in a plane square to direction, offsets exactly (fit_error 0); anything else is fitted within tolerance (none: the effective tolerance), fit_error bounding the distance from the exact offset. A closed smooth curve offsets to a closed curve; a distance of 0 is a copy. A zero direction, a distance that is not finite, a corner (a kink the offset would tear at: offset a Profile for corner styles), a curve running along direction, or an offset that folds over (an arc's radius used up, a turn tighter than distance) returns an Error in its Result.

NurbsCurve::offset_normal_to_sheet()

Result<NurbsCurve> offset_normal_to_sheet(const Solid& solid, double distance, std::optional<double> tolerance = std::nullopt) const

This curve, lying on the sheet solid (within ten times tolerance), moved distance along the sheet's normal at each of its points — off the sheet the way its faces face for a positive distance — as Rhino's OffsetNormalToSurface, and fitted within tolerance (none: the inputs' effective tolerance); fit_error bounds the distance from the exact offset. A curve off the sheet, one crossing a crease (faces whose normals differ by more than a degree), a distance that is not finite, or an offset that folds over returns an Error in its Result.

NurbsCurve::offset_tangent_to_sheet()

Result<NurbsCurve> offset_tangent_to_sheet(const Solid& solid, double distance, std::optional<double> tolerance = std::nullopt) const

This curve, lying on the sheet solid (within ten times tolerance), moved distance in the sheet's tangent plane, square to the curve — along the sheet's normal crossed with the curve's tangent for a positive distance, straight rather than walked across the sheet as NurbsCurve::offset_on_sheet() does — as Rhino's OffsetTangentToSurface. Fitted within tolerance (none: the inputs' effective tolerance); fit_error bounds the distance from the exact offset. A curve off the sheet, one crossing a crease, a distance that is not finite, or an offset that folds over returns an Error in its Result, as for NurbsCurve::offset_normal_to_sheet().

NurbsCurve::pull_back()

Result<NurbsCurve> pull_back(const Solid& solid, std::uint32_t face, std::optional<double> tolerance = 1e-3) const

This curve, lying on face face of solid within tolerance, read back into the face's surface parameters, as Rhino's Pullback: a uv curve — a curve in the z = 0 plane whose x is u and y is v — over this curve's own domain, its point at t paired with this curve's at t. The face is its whole surface; its trims are not read. Exact where the curve runs along a parameter line and in a plane, fitted elsewhere. Across a periodic surface's seam the uv curve runs on rather than jumping a period; where the curve ends at a pole (a sphere's, a cone's apex) it meets the pole line square, and where it passes over one it gains a run along the pole line, so past that point its parameter no longer pairs with this curve's. fit_error is the deviation reached. A curve standing off the surface past the tolerance returns an Error in its Result, naming where and how far.

NurbsCurve::push_up()

Result<NurbsCurve> push_up(const Solid& solid, std::uint32_t face, std::optional<double> tolerance = 1e-3) const

This uv curve (z = 0: x is u, y is v) carried out through face face's surface of solid, as Rhino's Pushup: a curve in space over the same domain within tolerance of the surface's points along it — exact on a plane and along a parameter line (the surface's own circle, ruling or isocurve). fit_error is the deviation reached. A curve off the z = 0 plane, or one leaving a patch's domain on a side that does not wrap, returns an Error in its Result.

NurbsCurve::fit_to_face()

Result<NurbsCurve> fit_to_face(const Solid& solid, std::uint32_t face, const std::optional<Vec3>& direction = std::nullopt, const std::vector<double>& knots = {}, std::optional<double> tolerance = 1e-3) const

This curve carried onto face face of solid and fitted to the face's surface parameter it crosses, as Rhino's FitCurveToSurface. It is projected onto the surface along direction, or pulled (each point to its nearest) where there is none; the trace must cross the face's parameter rectangle — the box its trims span in its surface's parameters — from one side to the opposite one. The result is parametrised by the parameter it crosses: at t it is over u = t (or v = t), running with it rising, over the face's range, on the surface's own knots in that direction plus knots, at the surface's degree there (at least 3) — knot-compatible with the surface's isocurves. Where it is farther than tolerance from the trace, knots are added halfway along the spans still off; fit_error bounds the distance from the exact trace. A trace that does not cross, one that turns back, or a knot outside the range returns an Error in its Result.

NurbsCurve::through_on_face()

static Result<NurbsCurve> through_on_face(const Solid& solid, std::uint32_t face, const std::vector<Vec3>& points, bool closed = false, std::optional<double> tolerance = 1e-3)

A smooth curve through points lying on face face of solid, as Rhino's InterpolatedCurveOnSurface: each point's nearest foot on the face's surface, interpolated in its parameters (cubic, chord-length) and carried out through it within tolerance. Feet either side of a seam are joined the short way. closed runs back to the first point, smooth across the join; a ring round a cylinder closes. A point farther than tolerance from the surface returns an Error in its Result, naming its index.

NurbsCurve::through_uv_on_face()

static Result<NurbsCurve> through_uv_on_face(const Solid& solid, std::uint32_t face, const std::vector<Vec2>& uvs, bool closed = false, std::optional<double> tolerance = 1e-3)

A smooth curve through the surface parameters uvs ((u, v) pairs) of face face of solid, as Rhino's InterpolatedCurveOnSurfaceUV: interpolated in the parameters (cubic, chord-length) and carried out through the surface within tolerance. closed runs back to the first point; a ring whose last point is a whole period short of the first winds round a periodic surface and closes. A ring winding both parameters at once, or fewer points than the curve needs, returns an Error in its Result.

NurbsCurve::short_path()

static Result<NurbsCurve> short_path(const Solid& solid, std::uint32_t face, const Vec2& a, const Vec2& b, std::optional<double> tolerance = 1e-3)

The shortest path on face face's surface of solid from the surface parameters a to b ((u, v) pairs), as Rhino's ShortPath, within tolerance: a geodesic — the straight run between them in the parameters relaxed until its length settles, tried a period either way round a periodic surface and the shortest kept. It is the shortest among those starts: the quadrics' and a gentle patch's shortest path, while a hill between the points may hide a shorter way round. The face's trims are not read. fit_error is the deviation reached. Two equal points returns an Error in its Result.

NurbsCurve::is_isoparametric()

Result<std::optional<std::pair<std::string, double>>> is_isoparametric(const Solid& solid, std::uint32_t face, std::optional<double> tolerance = std::nullopt) const

Whether this curve runs along one of face face's isocurves of solid, as Rhino's IsIsoparametric: ("u", v) along u with v held, ("v", u) along v with u held, or std::nullopt — neither, or not on the face. Read back into the face's parameters at tolerance (0 or std::nullopt the solid's own), it is an isocurve where its parameter spread across the held direction is within tolerance in space.

NurbsCurve::reverse()

Result<NurbsCurve> reverse() const

The same curve run the other way over the same domain.

NurbsCurve::trim()

Result<NurbsCurve> trim(double t0, double t1) const

The part from t0 to t1 (t0 < t1, both inside the domain), over t0..t1.

NurbsCurve::extend()

Result<NurbsCurve> extend(double length, bool at_start = false) const

This curve continued length past its end (or its start, at_start=True) along its own end polynomial: position, tangent and curvature there unchanged, and every old parameter still names its old point — the domain grows on that side only.

NurbsCurve::elevate()

Result<NurbsCurve> elevate(std::uint32_t by = 1) const

The same curve at degree degree + by (the result at most 12).

NurbsCurve::insert_knot()

Result<NurbsCurve> insert_knot(double t, std::uint32_t times = 1) const

The same curve, exactly, with the knot t (strictly inside the domain) inserted times times (Boehm insertion; Rhino's Knots.InsertKnot): more control points, every point of the curve kept. A t outside the domain, a times of 0, or a multiplicity there past the degree, returns an Error in its Result.

NurbsCurve::refine_knots()

Result<NurbsCurve> refine_knots(const std::vector<double>& knots) const

The same curve, exactly, with every knot of knots inserted (non-decreasing, each strictly inside the domain, no multiplicity past the degree).

NurbsCurve::remove_knot()

Result<std::pair<NurbsCurve, std::uint32_t>> remove_knot(double t, std::uint32_t times = 1, std::optional<double> tolerance = std::nullopt) const

Up to times copies of the inner knot t removed (Rhino's Knots.RemoveKnots), each only while the curve stays within tolerance of itself (none, 0 or NaN: the curve's effective tolerance): the curve and how many went — 0, and an unchanged copy, where none could (a knot holding a corner). A t that is not an inner knot, or a negative tolerance, returns an Error in its Result.

Answers a std::pair of the new handle and the count.

NurbsCurve::make_compatible()

static Result<std::vector<NurbsCurve>> make_compatible(const std::vector<NurbsCurve>& curves)

curves made compatible (Rhino's MakeCompatible): each reparametrised to [0, 1], raised to the highest degree among them and refined with every other's knots, so all share one degree, one knot vector and one control-point count — each the same point set it was, rational curves exactly. The ground NurbsCurve::tween()'s "matching" and a loft stand on. No curves returns an Error in its Result.

NurbsCurve::reparametrize()

Result<NurbsCurve> reparametrize(double lo, double hi) const

The same curve over the domain [lo, hi] (lo < hi), the parameter mapped affinely (Rhino's Reparameterize).

NurbsCurve::make_uniform()

Result<NurbsCurve> make_uniform() const

The control points and weights over evenly spaced knots on the domain (Rhino's MakeUniform): clamped where it was clamped. The shape moves unless the knots were uniform already.

NurbsCurve::non_rational()

Result<NurbsCurve> non_rational() const

Every weight 1, the control points where they were (Rhino's MakeNonRational): exact where the weights were all equal, otherwise the plain B-spline of the same polygon.

NurbsCurve::greville_parameters()

Result<std::vector<double>> greville_parameters() const

The Greville abscissae, one per control point: each the mean of the degree knots after its first — where a control point pulls hardest, and the parameters to interpolate at.

NurbsCurve::greville_points()

Result<std::vector<Vec3>> greville_points() const

The curve's points at its NurbsCurve::greville_parameters(), one per control point.

NurbsCurve::periodic()

Result<NurbsCurve> periodic(bool smooth = true) const

A periodic curve (seamless, C^(degree-1) all round) of the same degree (Rhino's CreatePeriodicCurve); a closed curve's repeated last control point is dropped first. smooth false keeps the control points and weights and wraps the polygon over uniform knots on [0, m] for m points; true (the default) keeps close to the curve instead: a periodic curve through its Greville points on [0, 1]. Fewer than degree + 1 distinct control points returns an Error in its Result.

NurbsCurve::mean()

Result<NurbsCurve> mean(const NurbsCurve& other, std::optional<double> tolerance = std::nullopt) const

The curve halfway between this one and other (Rhino's CreateMeanCurve): other lined up with this one first (NurbsCurve::lined_up_with()), the two made compatible exactly and averaged — two arcs about one centre give the arc of the mean radius. tolerance (none, 0 or NaN: the curves' effective tolerance) decides whether each is closed. One curve closed and the other open returns an Error in its Result.

NurbsCurve::lined_up_with()

Result<NurbsCurve> lined_up_with(const NurbsCurve& other, std::optional<double> tolerance = std::nullopt) const

This curve turned to run with other — an open one reversed where its ends lie crosswise to other's, a closed one reversed where it goes round the other way and its seam moved to match — the same point set either way; unchanged where one is closed and the other open.

NurbsCurve::directions_match()

Result<bool> directions_match(const NurbsCurve& other, std::optional<double> tolerance = std::nullopt) const

Whether other runs the same way as this curve (Rhino's DoDirectionsMatch): two closed curves going round the same way, otherwise other's ends lying along this one's rather than crosswise. A closed curve with no area returns an Error in its Result.

NurbsCurve::conic_type()

Result<ConicType> conic_type(std::optional<double> tolerance = std::nullopt) const

Which conic this curve is, read from its points within tolerance (none, 0 or NaN: its effective tolerance; Rhino's GetConicSectionType): "circle", "ellipse", "hyperbola" or "parabola", or std::nullopt for a curve that is none (straight, not planar, off every conic). Any exact form reads the same: a circle raised to degree 5 is a circle. A negative tolerance returns an Error in its Result.

Answers a ConicType: ConicType::circle, ellipse, hyperbola or parabola, ConicType::none for none.

NurbsCurve::transform()

Result<NurbsCurve> transform(const Transform& t) const
Result<NurbsCurve> transform(const std::array<double, 16>& matrix) const

This curve through the affine map t (a Transform or 16 numbers): its control points mapped, weights and knots kept — exact. A singular map, a projection, is allowed.

NurbsCurve::degree()

std::uint32_t degree() const

The curve's degree.

NurbsCurve::control_points()

Result<std::vector<Vec3>> control_points() const

The control points, as (x, y, z) triples.

NurbsCurve::weights()

Result<std::vector<double>> weights() const

One weight per control point; all 1 for a plain B-spline.

NurbsCurve::knots()

Result<std::vector<double>> knots() const

The full knot vector, len(control_points) + degree + 1 values.

NurbsCurve::domain()

Result<std::pair<double, double>> domain() const

The parameter domain (lo, hi).

NurbsCurve::is_rational()

bool is_rational() const

Whether the weights differ: a true NURBS rather than a plain B-spline.

NurbsCurve::is_closed()

bool is_closed() const

Whether the curve ends where it starts (to 1e-10 of its size).

NurbsCurve::point()

Result<Vec3> point(double t) const

The point at parameter t; a t outside the domain returns an Error in its Result.

NurbsCurve::derivatives()

Result<std::vector<Vec3>> derivatives(double t, std::uint32_t order = 2) const

The point and its derivatives at t up to order (at most 8): [C, C', C'', ...].

NurbsCurve::curvature()

Result<Curvature> curvature(double t) const

The Curvature and Frenet frame at t. A point where the curve has no tangent returns an Error in its Result.

NurbsCurve::length()

Result<Length> length(double accuracy = 0.0) const

The curve's length as a Length, to the relative accuracy (0 asks for the default).

NurbsCurve::length_between()

Result<Length> length_between(double t0, double t1, double accuracy = 0.0) const

The length over [t0, t1] of the curve's parameter as a Length, as Rhino's GetLength(subdomain), to the relative accuracy (0 asks for the default). A range running backwards or outside the domain returns an Error in its Result.

NurbsCurve::point_at_length()

Result<At> point_at_length(double s, double accuracy = 0.0) const

The point at arc length s from the start, as an At (segment empty).

NurbsCurve::point_at_normalized_length()

Result<At> point_at_normalized_length(double f, double accuracy = 0.0) const

The point at the fraction f of the curve's length, f in [0, 1], as an At, as Rhino's PointAtNormalizedLength (its parameter is NormalizedLengthParameter's answer). 0 is the start and 1 the end exactly.

NurbsCurve::points_at_normalized_lengths()

Result<std::vector<At>> points_at_normalized_lengths(const std::vector<double>& fractions, double accuracy = 0.0) const

The points at each fraction of fs of the curve's length, as At samples in the order given, over one measure of it, as Rhino's NormalizedLengthParameters.

NurbsCurve::divide_by_count()

Result<std::vector<At>> divide_by_count(std::uint32_t n, double accuracy = 0.0) const

The curve in n pieces of equal arc length: n + 1 At samples, n for a closed curve (its start not repeated).

NurbsCurve::divide_by_length()

Result<std::vector<At>> divide_by_length(double step, double accuracy = 0.0) const

Samples every step of arc length from the start; the last piece is whatever is left, and a closed curve never repeats its start.

NurbsCurve::divide_equidistant()

Result<std::vector<At>> divide_equidistant(double distance) const

Points along the curve each distance in a straight line from the one before, as Rhino's DivideEquidistant, each an At: the first the curve's start, each next the first point further on that is distance from the last, until none is; a closed curve does not wrap. Each point's error is how far its chord is from distance.

NurbsCurve::divide_as_contour()

Result<std::vector<At>> divide_as_contour(const Vec3& start, const Vec3& end, double interval) const

Where the curve crosses the planes square to end - start through start and every interval on towards end, as Rhino's DivideAsContour, each an At in the curve's parameter order; a plane the curve lies in gives none. Each point's error is its distance from its plane.

NurbsCurve::mass()

Result<LengthMass> mass(double accuracy = 0.0) const

The curve's length mass properties per unit length density as a LengthMass, as Rhino's LengthMassProperties, to the relative accuracy (0 asks for the default).

NurbsCurve::plane_hits()

Result<std::vector<At>> plane_hits(const Vec3& origin, const Vec3& normal) const

Where the curve crosses the plane through origin with normal, in parameter order, each an At whose error is the point's distance from the plane. A curve lying in the plane returns an Error in its Result; a touch that does not cross is not listed.

NurbsCurve::face_hits()

Result<std::vector<At>> face_hits(const Solid& solid, std::uint32_t face, std::optional<double> tolerance = 1e-3) const

Where the curve crosses face face of solid (its whole surface), within tolerance of it, in parameter order, each an At whose error is the point's distance from the surface. A touch that does not cross is not listed.

NurbsCurve::comb()

Result<std::vector<std::pair<Vec3, Vec3>>> comb(std::uint32_t n = 64, double scale = 1.0) const

A curvature comb to draw: at n + 1 even parameters, the curve point and that point moved by -scale * kappa * normal, out of the bend. Straight stretches give zero teeth.

NurbsCurve::inflections()

Result<std::vector<At>> inflections() const

Where the curvature turns from one side to the other, in parameter order, each an At (error zero): the comb flipping sides. Empty for a curve that bends one way only — what a test of a design line asks for.

NurbsCurve::knot_continuity()

Result<KnotContinuity> knot_continuity() const

How smoothly the curve runs through its own knots (a closed curve's seam among them), as a KnotContinuity: the largest turn of its tangent and the largest jump of its curvature.

HealthReport

struct HealthReport

What is wrong with a body, as plain data: what Solid::health() returns. Nothing in it moves the body. It lists the free edges (the sides only one face bounds) and the wires they chain into, the features below the tolerance, the loose edges, what sewing would join and leave, and, if asked for, where the body's mesh cracks. The tolerance is an absolute length, as Rhino's model tolerance is; it is reported back as used.

HealthReport::tolerance

double tolerance

The length below which a feature is small and a gap closes, as used: by default 1e-4 times the body's diagonal. A value that is not finite and positive (NaN, infinite, zero or negative) takes the default.

HealthReport::rounding

double rounding

The rounding the body's vertices are merged at, as used.

HealthReport::extent

double extent

The body's diagonal, the length the default tolerance is a fraction of.

HealthReport::free_edges

std::vector<FreeEdge> free_edges

The free edges, as FreeEdge rows, each wire's edges together and in order.

HealthReport::wires

std::vector<FreeWire> wires

The chains the free edges make end to end, as FreeWire rows.

HealthReport::small

std::vector<SmallFeature> small

The features below the tolerance, as SmallFeature rows.

HealthReport::loose_edges

std::uint32_t loose_edges

How many shared edges are loose: the two faces' sides along the edge lie further apart than the larger of the tolerance the body recorded for the edge and the one given.

HealthReport::worst_loose

double worst_loose

The widest such gap; 0 when no edge is loose.

HealthReport::sew_pairs

std::uint32_t sew_pairs

How many pairs of free edges Brep::sew() (or Solid::join_sheets()) would join: those with shared_ends 2.

HealthReport::sew_refused

std::uint32_t sew_refused

How many groups of free edges it would leave free.

HealthReport::sew_worst_gap

double sew_worst_gap

The widest gap it would sew.

HealthReport::cracks

std::optional<Cracks> cracks

Where the body's mesh cracks, as a Cracks; std::nullopt unless the call asked for the mesh. Cracks are only counted on a closed body: for an open one the census is empty by design, so watertight false beside no edges means "not asked", not "nothing found".

HealthReport::worst_gap

double worst_gap

The widest gap between a free edge and its partner. A rim has no true partner, so it reads as a gap the size of the part.

HealthReport::wire_edges()

Result<std::vector<FreeEdge>> wire_edges(std::uint32_t wire) const

The free edges of one wire, by its number in wires, in order.

FreeEdge

struct FreeEdge

One free edge: a side only one face bounds, with its nearest partner. The partner is the nearest free edge other than a neighbour on its own wire, so the rim of a sheet reads as a gap the size of the part rather than as a crack, and a real seam reads as a small gap. The partner is a row index into free_edges.

FreeEdge::trim

std::uint32_t trim

The face's side this is.

FreeEdge::edge

std::optional<std::uint32_t> edge

The edge it lies on; std::nullopt for a side that has no edge.

FreeEdge::face

std::uint32_t face

The face it bounds.

FreeEdge::wire

std::uint32_t wire

The free wire it is on: a row of wires.

FreeEdge::partner

std::optional<std::uint32_t> partner

The nearest free edge across the gap, as an index into free_edges; std::nullopt if there is none.

FreeEdge::shared_ends

std::uint32_t shared_ends

How many of its two ends it shares with the partner: 2 is what Brep::sew() joins.

FreeEdge::length

double length

Its length.

FreeEdge::gap

double gap

The distance to the partner; infinite without one.

FreeWire

struct FreeWire

A chain of free edges end to end.

FreeWire::first

std::uint32_t first

The row of free_edges it starts at: its edges are the rows first to first + count.

FreeWire::count

std::uint32_t count

How many free edges it holds.

FreeWire::closed

bool closed

Whether it closes on itself.

FreeWire::length

double length

Its total length.

FreeWire::widest_gap

double widest_gap

The widest gap from any of its edges to a partner.

SmallFeature

struct SmallFeature

Something below the tolerance.

SmallFeature::kind

std::string kind

What it is: short_edge, collapsed_edge, sliver_face, tiny_face, tiny_body or small_hole (an inner loop whose edges are all free, below the tolerance in area or width: a pinhole in an open sheet; a hole with walls is not one).

SmallFeature::index

std::uint32_t index

Its edge, face or body number; a small hole's is its loop number.

SmallFeature::size

double size

How small it is.

Cracks

struct Cracks

What a mesh of the body shows, asked for with mesh=True: the call meshes the body. Only a closed body is counted: an open one's census is empty by design, as its rim is not a crack.

Cracks::watertight

bool watertight

Whether the mesh has no open or folded edge.

Cracks::open

std::uint32_t open

How many mesh edges only one triangle uses.

Cracks::folded

std::uint32_t folded

How many mesh edges more than two triangles use.

Cracks::crossings

std::uint32_t crossings

How many pairs of triangles pass through each other.

Cracks::edges

std::vector<std::uint32_t> edges

The body's edges the cracks lie along.

HealReport

struct HealReport

What Solid::heal() did, as plain data: the fixes it made, the small features it left and why, and the body's health before and after at the tolerance it healed at. Indices are the input body's.

HealReport::tolerance

double tolerance

The tolerance it healed at, as used: by default 1e-4 times the body's diagonal.

HealReport::moved

double moved

The furthest any trim the result keeps moved, measured: the edited trims against the originals. Not the same measure as a HealFix's moved, which is how far that fix's merged vertices moved: a curve can move further than its ends, and the trims of a dropped edge are not measured at all, so either can be the larger.

HealReport::guarded

bool guarded

Whether the guard refused a fix: the full result was worse (less closed, more free or non-manifold edges, or no faces left), so the face pass's fixes were refused and the rest kept, or, if that was still worse, every fix was refused and the body came back as it was. Refused fixes are listed as body_guard.

HealReport::fixes

std::vector<HealFix> fixes

What was done, as HealFix rows, in the order it was done. A short edge removed as part of a face is that face's fix and is not listed again.

HealReport::refused

std::vector<HealRefusal> refused

What health listed as small and was left, as HealRefusal rows.

HealReport::small_before

std::uint32_t small_before

How many small features health listed on the input.

HealReport::small_after

std::uint32_t small_after

How many it lists on the result.

HealReport::free_before

std::uint32_t free_before

The input's free edges (sides only one face bounds).

HealReport::free_after

std::uint32_t free_after

The result's free edges.

HealReport::closed_before

bool closed_before

Whether the input was closed.

HealReport::closed_after

bool closed_after

Whether the result is closed.

HealReport::nonmanifold_before

std::uint32_t nonmanifold_before

The input's edges three or more faces share.

HealReport::nonmanifold_after

std::uint32_t nonmanifold_after

The result's.

HealFix

struct HealFix

One small feature removed.

HealFix::kind

std::string kind

What it was, as SmallFeature's kind.

HealFix::index

std::uint32_t index

Its edge, face or loop number in the input, as health gave it.

HealFix::size

double size

How small it was.

HealFix::moved

double moved

How far the vertices this fix merged moved. The report's own moved is a second measure, how far any surviving trim moved, measured; either can be the larger.

HealRefusal

struct HealRefusal

One small feature left, and why.

HealRefusal::kind

std::string kind

What it is, as SmallFeature's kind.

HealRefusal::index

std::uint32_t index

Its edge, face or loop number in the input.

HealRefusal::why

std::string why

would_empty_loop (removing the edge would leave a loop with no trims: the face pass's case), closed (both ends already one vertex: a tiny closed curve), seam (one face uses the edge twice), chain (the vertices to merge span more than the tolerance), neighbours_part (a sliver's two long sides part by more than the tolerance), uneven (a sliver's long edges are not two, one per side), non_manifold (a sliver side three or more trims share), has_holes (the sliver or tiny face has inner loops), body_guard (the guard refused the fix), toggled (its kind switched off) or unsupported (a tiny body, which healing never removes).

HealRefusal::figure

double figure

The width of a chain, the gap of neighbours_part; 0 otherwise.

RecognizeReport

struct RecognizeReport

What Solid::recognize() did, as plain data: the faces and edges given an analytic kind, the faces left free-form and why, and the tolerance it fitted to. Faces and edges are numbered as in the body, before and after alike.

RecognizeReport::tolerance

double tolerance

The tolerance it fitted to, as used: by default 1e-6 of the body's extent.

RecognizeReport::faces

std::vector<RecognizedFace> faces

The faces given an analytic kind, as RecognizedFace rows.

RecognizeReport::refused

std::vector<RecognizeRefusal> refused

The free-form faces left, as RecognizeRefusal rows.

RecognizeReport::edges

std::vector<RecognizedEdge> edges

The edges whose curve was given an analytic kind, as RecognizedEdge rows, in edge order.

RecognizeReport::edges_left

std::uint32_t edges_left

How many edges were left on a free-form curve.

RecognizeReport::worst_face

double worst_face

The furthest any face taken lies from its analytic surface; 0 when none was taken.

RecognizeReport::worst_edge

double worst_edge

The furthest any edge taken lies from its analytic curve; 0 when none was taken.

RecognizedFace

struct RecognizedFace

One face given an analytic kind.

RecognizedFace::face

std::uint32_t face

Its face number, the same before and after.

RecognizedFace::kind

std::string kind

plane, cylinder, cone, sphere or torus.

RecognizedFace::deviation

double deviation

The furthest any sample of the face or point of its edges lies from the analytic surface.

RecognizeRefusal

struct RecognizeRefusal

One face left free-form, and why.

RecognizeRefusal::face

std::uint32_t face

Its face number.

RecognizeRefusal::why

std::string why

no_kind (no kind fits within the tolerance), mixed_normals (its normals point both ways), parameter_trims (a trim in its surface's parameters could not be lifted to space) or too_few_samples.

RecognizeRefusal::closest

std::optional<double> closest

For no_kind, the deviation of the kind that came closest; std::nullopt otherwise.

RecognizedEdge

struct RecognizedEdge

One edge whose curve was given an analytic kind.

RecognizedEdge::edge

std::uint32_t edge

Its brep edge id, as edge_tolerance takes one.

RecognizedEdge::kind

std::string kind

line, circle or ellipse.

RecognizedEdge::deviation

double deviation

The furthest any point of the curve or the edge lies from the analytic curve.

JoinReport

struct JoinReport

What Solid::join_sheets() did.

JoinReport::sewn

std::uint32_t sewn

Edges sewn: each is two naked edges become one shared edge.

JoinReport::worst_gap

double worst_gap

The widest gap between two sewn edges; 0 where every edge met exactly.

JoinReport::naked_before

std::uint32_t naked_before

Edges bordered by one face before the sewing.

JoinReport::naked_after

std::uint32_t naked_after

Edges bordered by one face after it: 0 for a closed result.

JoinReport::refused

std::uint32_t refused

Groups of naked edges sharing both ends that were left apart: too far apart, or three or more.

JoinReport::turned

std::uint32_t turned

Faces whose sense the join turned.

JoinReport::closed

bool closed

Whether the result is closed — every edge bordered twice — and so a solid.

SymmetryReport

struct SymmetryReport

What Solid::mirror_join() did, and how well the seam on the plane meets. The curvature is the largest difference of the two sides' normal curvatures in any one direction: across a mirror the curvature square to the seam is always equal, and what can differ is the twist along it.

SymmetryReport::seams

std::uint32_t seams

Edges on the plane, each one face of the half and one of its mirror.

SymmetryReport::squared

std::uint32_t squared

Faces of the half squared to the plane.

SymmetryReport::moved

double moved

The furthest any control point moved squaring them.

SymmetryReport::gap

double gap

The seam's largest gap between the two sides (G0).

SymmetryReport::angle

double angle

The seam's largest angle between the two sides' normals, in radians (G1).

SymmetryReport::curvature

double curvature

The seam's largest difference of normal curvature in any one direction (G2).

SymmetryReport::naked

std::uint32_t naked

Naked edges left on the body: the half's own boundary off the plane, and any edge on it with no mirror to sew to.

PatternReport

struct PatternReport

What Solid::pattern() or Solid::pattern_feature() did.

PatternReport::instances

std::uint32_t instances

Instances placed, after the skips.

PatternReport::booleans

std::uint32_t booleans

Booleans run: copies apart from each other share one.

PatternReport::missed

std::uint32_t missed

Copies of a feature's tool sharing no volume with the body: dropped for a cut, kept as a body of their own for a join.

HoleReport

struct HoleReport

What Solid::hole() did.

HoleReport::holes

std::uint32_t holes

Holes drilled, one a point.

HoleReport::bottoms

std::vector<double> bottoms

Per hole, the distance along the axis from the point to where the bore ends, the drill point excluded: depth for a blind hole; for the others the deepest point of the material it passes, rim included.

HoleReport::faces_added

std::uint32_t faces_added

Faces of the result on no surface of the body.

HoleReport::thread_depths

std::vector<double> thread_depths

Per hole, a tapped thread's length from where it starts; empty without a thread.

ThreadSize

struct ThreadSize

One row of the thread size table (cadaclysm::blacksmith::thread_sizes(), cadaclysm::blacksmith::thread_size()): ISO metric coarse M1 .. M64, ISO metric fine M8x1 .. M64x4, UNC #1 .. 1-1/2" and UNF #0 .. 1-1/2" (ASME B1.1). Every length in millimetres; the derived figures are the basic ISO 68-1 profile's. Frozen.

ThreadSize::family

ThreadFamily family

"iso_metric_coarse", "iso_metric_fine", "unc" or "unf".

ThreadSize::designation

std::string designation

"M10", "M10x1.25", "1/4-20 UNC", "#10-32 UNF".

ThreadSize::size

std::string size

"M10", "1/4", "#10".

ThreadSize::major

double major

The major (nominal) diameter.

ThreadSize::pitch

double pitch

The pitch (25.4 / TPI for a UN row).

ThreadSize::minor

double minor

The basic minor diameter D - 1.082532 P: the internal thread's crest.

ThreadSize::pitch_diameter

double pitch_diameter

The basic pitch diameter D - 0.649519 P.

ThreadSize::tap_drill

double tap_drill

D - P: the ~75 % engagement rule, not a drill chart (M6 5.0, M10 8.5).

ThreadSize::clearance

std::map<std::string, double> clearance

ISO 273's clearance holes by fit, {"fine": .., "medium": .., "coarse": ..}; empty for a UN row or a size ISO 273 has no row for.

ThreadReport

struct ThreadReport

What Solid::thread() did.

ThreadReport::internal

bool internal

True for a bore's thread, false for a rod's.

ThreadReport::major

double major

The major diameter.

ThreadReport::minor

double minor

The basic minor diameter.

ThreadReport::pitch

double pitch

The pitch.

ThreadReport::start

Vec3 start

The point on the axis where the span begins.

ThreadReport::direction

Vec3 direction

The unit direction along the axis into the span.

ThreadReport::length

double length

The span's length.

ThreadReport::turns

double turns

The coil's turns, its run past an open end included.

ThreadReport::faces_added

std::uint32_t faces_added

Faces of the result on no surface of the body.

ThreadRecord

struct ThreadRecord

A cosmetic thread as a face carries it (Solid::cosmetic_thread(), or a tapped hole not modelled).

ThreadRecord::designation

std::string designation

The table row's designation; "" for an explicit form.

ThreadRecord::major

double major

The major diameter.

ThreadRecord::pitch

double pitch

The pitch.

ThreadRecord::length

double length

The span's length.

ThreadRecord::offset

double offset

How far from the start end the span begins.

ThreadRecord::internal

bool internal

True for a bore's thread.

ThreadRecord::left_handed

bool left_handed

True for a left-handed thread.

ThreadRecord::reverse

bool reverse

True where the span starts from the face's other end.

Pattern

class Pattern

Placements for Solid::pattern() and Solid::pattern_feature(): lists of rigid Transforms, instance 0 the identity (the original). skip leaves instances out by index (Fusion's suppressed instances), 0 included. Angles are radians. A count of 0, a spacing not finite, a zero direction or axis, a skip past the count, or every instance skipped returns an Error in its Result.

Pattern::rectangular()

static Result<std::vector<Transform>> rectangular(const Vec3& direction1, std::uint32_t count1, double spacing1, const std::optional<Vec3>& direction2 = std::nullopt, std::uint32_t count2 = 1, double spacing2 = 0.0, bool symmetric = false, const std::vector<std::uint32_t>& skip = {})

count1 instances spacing1 apart along direction1, times count2 spacing2 apart along direction2 (std::nullopt: one row); row-major, direction 1 fastest. symmetric puts count on each side of the original along each direction (2 count - 1, at offsets 0, +s, -s, +2s, ...).

Pattern::circular()

static Result<std::vector<Transform>> circular(const Vec3& axis_point, const Vec3& axis_direction, std::uint32_t count, double angle = 2.0 * 3.14159265358979323846, bool symmetric = false, const std::vector<std::uint32_t>& skip = {})

count instances about the line through axis_point along axis_direction: a full turn (angle 2 pi, the default) spaces them evenly; less spreads them over angle with both ends occupied. symmetric spreads count over angle on each side; with a full turn, which has no sides, it returns an Error in its Result. Right-handed about the direction.

Pattern::along()

static Result<std::vector<Transform>> along(const NurbsCurve& curve, std::uint32_t count, std::optional<double> spacing = std::nullopt, PatternOrient orient = PatternOrient::fixed, const std::vector<std::uint32_t>& skip = {})

count instances along a NurbsCurve by arc length from its start, spacing apart, or spread over its whole length with both ends occupied (spacing std::nullopt). orient "fixed" translates each copy; "path" also turns it by the curve's rotation-minimising frame from the first instance's.

Pattern::mirror()

static Result<std::vector<Transform>> mirror(const Frame& plane)
static Result<std::vector<Transform>> mirror(const std::array<double, 12>& plane)

Two instances: the original (the identity) and its reflection across plane, its z the normal, as Transform::mirror(). Through Solid::pattern() it mirrors a body (the copy turned so it stays closed and outward); through Solid::pattern_feature() it mirrors a feature.

Continuity

struct Continuity

How well two faces meet along their sides — what Solid::continuity() returns. The angle ignores which way each face points; the curvature is the normal curvature square to the edge, about the first face's normal.

Continuity::gap

double gap

The largest distance between the two sides (G0).

Continuity::gap_at

Vec3 gap_at

Where on the first side it is.

Continuity::angle

double angle

The largest angle between the faces' normals, in radians (G1).

Continuity::angle_at

Vec3 angle_at

Where on the first side it is.

Continuity::curvature

double curvature

The largest difference of normal curvature across the edge (G2).

Continuity::curvature_at

Vec3 curvature_at

Where on the first side it is.

Continuity::samples

std::uint32_t samples

How many points along the first side were asked.

KnotContinuity

struct KnotContinuity

How smoothly a curve runs through its own knots — what NurbsCurve::knot_continuity() returns. A curve with no inner knot, and not closed, reads zero at its start.

KnotContinuity::angle

double angle

The largest turn of the tangent at a knot, in radians (G1).

KnotContinuity::angle_parameter

double angle_parameter

The knot it is at.

KnotContinuity::angle_at

Vec3 angle_at

The point there.

KnotContinuity::curvature

double curvature

The largest jump of the curvature vector kappa * normal at a knot (G2).

KnotContinuity::curvature_parameter

double curvature_parameter

The knot it is at.

KnotContinuity::curvature_at

Vec3 curvature_at

The point there.

CurvatureTurns

struct CurvatureTurns

Where a face's curvatures change sign — what Solid::curvature_turns() returns. A sample within a millionth of the face's size of flat is neither sign: a cylinder's patch reads no Gaussian area.

CurvatureTurns::gaussian_positive

std::uint32_t gaussian_positive

How many separate areas of the sample grid have a positive Gaussian curvature (a dome's).

CurvatureTurns::gaussian_negative

std::uint32_t gaussian_negative

How many have a negative one (a saddle's).

CurvatureTurns::gaussian_turns

std::vector<At> gaussian_turns

The points between opposite Gaussian signs, each an At: tangent the face's unit normal there, parameter its u.

CurvatureTurns::mean_positive

std::uint32_t mean_positive

How many separate areas have a positive mean curvature, about the face's outward normal.

CurvatureTurns::mean_negative

std::uint32_t mean_negative

How many have a negative one.

CurvatureTurns::mean_turns

std::vector<At> mean_turns

The points between opposite mean signs, as gaussian_turns.

CurvatureTurns::samples

std::uint32_t samples

The grid's steps each way.

HighlightKink

struct HighlightKink

The worst kink of the highlight lines crossing an edge — what Solid::highlight_kink() returns.

HighlightKink::angle

double angle

The angle in radians, 0 to pi/2, between a highlight line on one face and the same line on the other.

HighlightKink::at

Vec3 at

The point along the edge it is at.

HighlightKink::light_point

Vec3 light_point

A point on the straight light tube that shows it.

HighlightKink::light_direction

Vec3 light_direction

The tube's unit direction.

HighlightKink::samples

std::uint32_t samples

How many points along the edge were read.

DraftPoint

struct DraftPoint

A point of a face and the draft angle there — what Solid::draft_angle_at() returns.

DraftPoint::point

Vec3 point

The point on the face.

DraftPoint::uv

std::optional<std::array<double, 2>> uv

The surface parameters the normal was read at; none where there are none.

DraftPoint::normal

Vec3 normal

The face's outward unit normal there.

DraftPoint::angle

double angle

asin(normal . d) in radians, d the unit pull: positive where the face looks partly along the pull.

FaceDraft

struct FaceDraft

One face's draft over a body — what Solid::draft_analysis() returns, one per face. Angles in radians, areas the face's measuring mesh's.

FaceDraft::face

std::uint32_t face

The face's index.

FaceDraft::min

double min

The least draft angle over the face's samples (its triangles' centres and corners).

FaceDraft::max

double max

The greatest.

FaceDraft::area

double area

The face's whole area; 0 for a sliver narrower than the mesh.

FaceDraft::positive

double positive

The area whose angle is at least +threshold.

FaceDraft::negative

double negative

The area whose angle is at most -threshold.

FaceDraft::vertical

double vertical

The area within threshold of 0 either way: it needs draft.

FaceDraft::undercut

double undercut

The area whose release ray meets the body.

FaceDraft::kind

std::string kind

"undercut" where any area is undercut, else "positive", "negative" or "vertical" where that band holds the whole face, else "mixed".

SheetRule

struct SheetRule

How a sheet-metal part is made — what every sheet verb takes. Lengths in model units, the bend's neutral layer k_factor * thickness past its inner face.

SheetRule::thickness

double thickness

The sheet's thickness, positive.

SheetRule::bend_radius

std::optional<double> bend_radius

The bends' inner radius; none: the thickness, 0: a hundredth of it.

SheetRule::k_factor

double k_factor

Where the neutral layer lies, in [0, 1]; 0.44 by default.

SheetRule::relief

Relief relief

The bend relief cut where a flange is shorter than its edge: none, rectangular (default), round or tear.

SheetRule::relief_width

double relief_width

Its width; 0: the thickness.

SheetRule::relief_depth

double relief_depth

Its depth past the bend; 0: half the thickness.

SheetRule::corner

CornerRelief corner

The corner relief where two bends meet: none, square, round (default) or tear.

SheetRule::corner_size

double corner_size

Its size; 0: twice the thickness.

SheetRule::miter_gap

double miter_gap

The gap between two flanges meeting at a corner; 0: a tenth of the thickness.

SheetInfo

struct SheetInfo

A body read as sheet metal — what Solid::sheet_info() returns.

SheetInfo::thickness

double thickness

The sheet's thickness.

SheetInfo::fixed_face

std::uint32_t fixed_face

The flat broad face the reading is laid from.

SheetInfo::bends

std::vector<BendInfo> bends

Every bend, as a BendInfo.

BendInfo

struct BendInfo

One bend of a sheet body, in model space.

BendInfo::a_face

std::uint32_t a_face

The bend's face on the fixed face's side.

BendInfo::b_face

std::uint32_t b_face

Its partner across the thickness.

BendInfo::radius

double radius

The inner radius.

BendInfo::angle

double angle

The signed angle in radians: positive up from the fixed side.

BendInfo::axis

std::array<Vec3, 2> axis

The bend's axis: a point and a unit direction.

BendInfo::line

std::array<Vec3, 2> line

The bend's line on the mid-thickness surface: two points.

FlatPattern

class FlatPattern

A sheet body laid flat — what Solid::flat_pattern() returns. It holds a handle of the library's, freed as Lifetimes describes.

FlatPattern::body()

Result<Solid> body() const

The flat body: the outline extruded the thickness down from the frame.

FlatPattern::profile()

Result<Profile> profile() const

The flat's outline, a Profile in the frame's plane.

FlatPattern::frame()

const Frame& frame() const noexcept

The frame the flat lies in: the fixed face's, its top the frame's plane.

FlatPattern::bends()

const std::vector<FlatBend>& bends() const noexcept

Every bend zone as drawn, a FlatBend each.

FlatPattern::fold_bends()

const std::vector<Bend>& fold_bends() const noexcept

The part's bends as Solid::fold_flat() takes them back, a Bend each.

FlatPattern::dxf()

Result<std::string> dxf(PageUnits units = PageUnits::millimetres, bool extents = true, bool table = true, bool labels = true, bool notes = false, bool dimensions = false, bool folded = false) const

The flat pattern alone as DXF R2000 text for a cutter: the outline on layer OUTLINE, each bend line on BEND_UP (green) or BEND_DOWN (red), centre-lined; extents adds the zones' edges on BEND_EXTENT, table a ruled table of the bends on BEND_TABLE, labels a label on each line (B1 UP 90), and, as Page::add_flat_pattern() draws them, notes, dimensions and folded.

FlatPattern::close()

void close() noexcept

Free the handle now. Leaving a with block or the garbage collector does the same.

FlatBend

struct FlatBend

One bend zone of a FlatPattern, in the flat's own plane.

FlatBend::centre

std::array<Vec2, 2> centre

The zone's centre line: two points.

FlatBend::start

std::array<Vec2, 2> start

The zone's first edge: two points.

FlatBend::end

std::array<Vec2, 2> end

Its other edge: two points.

FlatBend::angle

double angle

The signed bend angle in radians.

FlatBend::radius

double radius

The inner radius.

FlatBend::k_factor

double k_factor

The neutral layer's K.

FlatBend::up

bool up

Whether it bends up, seen from the flat's top.

FlatBend::allowance

double allowance

The zone's width: |angle| (R + K T).

FlatBend::deduction

double deduction

The bend deduction: twice the outside setback less the allowance.

Bend

struct Bend

A bend to fold — what Solid::fold_flat() takes, and FlatPattern::fold_bends() gives.

Bend::line

std::array<Vec2, 2> line

The bend's line across the flat: two points.

Bend::angle

double angle

The signed angle in radians: positive up.

Bend::radius

double radius

The inner radius.

Bend::k_factor

double k_factor

The neutral layer's K.

Unrolled

struct Unrolled

Faces of a solid laid flat — what Solid::unroll() returns, read at once.

Unrolled::sheet

Solid sheet

The flat faces as one open Solid in the xy plane.

Unrolled::faces

std::vector<std::uint32_t> faces

Each flat face's source face.

Unrolled::curves

std::vector<std::vector<NurbsCurve>> curves

Each curve given, as its pieces on the flat (NurbsCurve values).

Unrolled::points

std::vector<std::optional<Vec3>> points

Each point given at its spot on the flat; none where it lies on no face laid flat.

Unrolled::not_developable

std::vector<std::uint32_t> not_developable

The faces left out because they are not developable.

Unrolled::cuts

std::vector<std::array<std::uint32_t, 2>> cuts

The shared edges cut, as pairs of source faces.

FromMeshReport

struct FromMeshReport

What Solid::from_mesh() made of a mesh, as plain data.

FromMeshReport::closed

bool closed

Whether the result is a closed solid: every edge shared by two triangles, every shell orientable. Otherwise it is an open shell.

FromMeshReport::faces

std::uint32_t faces

The result's faces.

FromMeshReport::edges

std::uint32_t edges

The result's edges.

FromMeshReport::vertices

std::uint32_t vertices

The result's vertices, after welding.

FromMeshReport::holes

std::uint32_t holes

Holes in the mesh: connected runs of boundary edges.

FromMeshReport::boundary_edges

std::uint32_t boundary_edges

Triangle edges only one triangle has.

FromMeshReport::non_manifold_edges

std::uint32_t non_manifold_edges

Triangle edges three or more triangles share; never repaired.

FromMeshReport::flipped

std::uint32_t flipped

Triangles whose winding the result reverses: to agree with their neighbours, or with a whole shell turned outward (or inward, for a void).

FromMeshReport::dropped

std::uint32_t dropped

Triangles dropped as degenerate after welding (a repeated corner, no area).

FromMeshReport::planes

std::uint32_t planes

Merged plane faces: those of more than one triangle (a lone triangle's face is not counted).

FromMeshReport::cylinders

std::uint32_t cylinders

Faces fitted with a cylinder (the prismatic mode).

FromMeshReport::cones

std::uint32_t cones

Faces fitted with a cone (the prismatic mode).

FromMeshReport::spheres

std::uint32_t spheres

Faces fitted with a sphere (the prismatic mode).

FromMeshReport::tori

std::uint32_t tori

Faces fitted with a torus (the prismatic mode).

Squished

struct Squished

Faces of a solid squished flat — what Solid::squish() returns, read at once.

Squished::sheet

Solid sheet

The flat faces as one open Solid in the xy plane.

Squished::faces

std::vector<std::uint32_t> faces

Each flat face's source face.

Squished::distortion

std::vector<SquishDistortion> distortion

Each flat face's distortion, flat over 3D: its area ratio per mesh triangle and its length ratio per mesh edge, each as min, max and mean (weighted by the 3D area or length). A face laid exactly has lengths 1.

Squished::exact

std::vector<std::uint32_t> exact

The source faces laid exactly, as Solid::unroll() lays them.

Squished::curves

std::vector<std::vector<NurbsCurve>> curves

Each curve given, as its pieces on the flat (NurbsCurve values).

Squished::points

std::vector<std::optional<Vec3>> points

Each point given at its spot on the flat; none where it lies on no face squished.

FacePoint

struct FacePoint

Where a point lies against a face — what Solid::face_point() and Solid::face_inner_point() return.

FacePoint::point

Vec3 point

The nearest point of the face, inside its trims or on their boundary.

FacePoint::uv

Vec2 uv

That point's parameters on the face's surface.

FacePoint::distance

double distance

From the asked point to it.

FacePoint::where

std::string where

Inside, on the boundary or off.

EdgePoint

struct EdgePoint

The nearest point of an edge's curve — what Solid::edge_point() and Solid::edge_inner_point() return.

EdgePoint::point

Vec3 point

The nearest point of the edge's curve over its range.

EdgePoint::t

double t

The curve's parameter there.

EdgePoint::distance

double distance

From the asked point to it.

EdgePoint::on

bool on

Whether that is within the tolerance.

EdgeConvexity

struct EdgeConvexity

How an edge's two faces meet — what Solid::edge_convexity() returns.

EdgeConvexity::kind

std::string kind

Smooth, convex, concave, mixed or open.

EdgeConvexity::angle_min

double angle_min

The smallest signed turn between the faces' outward normals, in radians (negative concave).

EdgeConvexity::angle_max

double angle_max

The largest (positive convex).

EdgeConvexity::at_min

Vec3 at_min

Where the smallest is.

EdgeConvexity::at_max

Vec3 at_max

Where the largest is.

EdgeConvexity::samples

std::uint32_t samples

The points asked along the edge (0 for an open edge or a closed surface's seam).

Angle

struct Angle

The angle between two faces or edges — what Solid::angle_to() returns.

Angle::angle

double angle

In radians.

Angle::at_a

Vec3 at_a

Where it is read on the first entity: its inner point, or for an axis the axis point nearest it.

Angle::at_b

Vec3 at_b

The same on the second.

Angle::kind

std::string kind

What the two were read as: two planes, two lines, or a line and a plane.

MinimumRadius

struct MinimumRadius

A face's smallest radius of curvature — what Solid::face_minimum_radius() returns.

MinimumRadius::radius

double radius

1 / max(|k1|, |k2|); infinite for a plane.

MinimumRadius::curvature

double curvature

That principal curvature, signed about the face's outward normal: positive where the face bends away from it (a boss), negative toward it (a bore).

MinimumRadius::at

Vec3 at

Where.

MinimumRadius::uv

Vec2 uv

Its parameters on the face's surface.

MinimumRadius::direction

Vec3 direction

The curvature's unit principal direction.

MinimumRadius::samples

std::uint32_t samples

The grid stations read inside the trims (0 where a closed form answered).

GearProfile

struct GearProfile

A gear's profile and its report — what Profile::gear_involute(), Profile::gear_wheel_cycloidal() and Profile::gear_pinion_cycloidal() return. Frozen.

GearProfile::profile

Profile profile

The gear's closed outline, a Profile.

GearProfile::pitch_radius

double pitch_radius

The pitch radius, module teeth / 2.

GearProfile::base_radius

std::optional<double> base_radius

The involute's base circle, pitch_radius cos(pressure_angle); std::nullopt for cycloidal gearing.

GearProfile::tip_radius

double tip_radius

The largest radius on the profile.

GearProfile::root_radius

double root_radius

The smallest radius on the profile.

GearProfile::thickness

double thickness

The tooth (leaf) thickness on the pitch circle, as an arc length.

GearProfile::undercut

bool undercut

Involute only: whether the gear's cutter would undercut it. The undercut is not drawn: the flank starts on the base or root circle.

Settle

struct Settle

Where the follower came to rest — what cadaclysm::blacksmith::contact_settle() returns. Frozen.

Settle::value

double value

The follower's resting angle, in radians; never penetrating.

Settle::contact

std::optional<SettleContact> contact

Where it touches the driver, a SettleContact; std::nullopt where it stopped at the limit.

Settle::recoiled

bool recoiled

Whether it started penetrating and was pushed back against the direction.

Settle::steps

std::uint32_t steps

The gap evaluations spent.

SettleContact

struct SettleContact

Where a Settle touches. Frozen.

SettleContact::point

Vec2 point

The midpoint of the closest pair, in the common plane.

SettleContact::normal

Vec2 normal

The unit contact normal, from the driver toward the follower.

SettleContact::driver

std::array<std::uint32_t, 2> driver

The driver's touching (loop, segment): loop 0 the outer, 1.. the holes in order; the segment an index into that loop's.

SettleContact::follower

std::array<std::uint32_t, 2> follower

The follower's touching (loop, segment).

AreaProperties

struct AreaProperties

A profile's area properties in its own plane — what Profile::area_properties() returns.

AreaProperties::area

double area

The region's area: the outer loop less its holes.

AreaProperties::area_error

double area_error

The integration's bound on it.

AreaProperties::perimeter

double perimeter

Every loop's length, holes included.

AreaProperties::centroid

Vec2 centroid

In the profile's coordinates.

AreaProperties::centroid_error

double centroid_error

The bound on it.

AreaProperties::second_moments

std::array<double, 3> second_moments

(Ixx, Iyy, Ixy) about the centroid: Ixx about the axis parallel to x, Ixy the product itself, not negated (unlike a solid's inertia).

AreaProperties::moments_error

double moments_error

The bound on them.

AreaProperties::principal_moments

Vec2 principal_moments

Ascending.

AreaProperties::principal_axes

std::array<Vec2, 2> principal_axes

Their two unit axes, the second the first turned a right angle.

AreaProperties::accuracy_met

bool accuracy_met

Whether every bound is within the accuracy asked.

Deviation

struct Deviation

How far apart two profiles' outlines run, as a named tuple: what Profile::deviation() returns. max_distance is the largest distance from a point of either outline to the other, reached between max_a on the profile asked and max_b on the other; min_distance the smallest (0 where they meet), between min_a and min_b. Points are (x, y); every figure within the tolerance asked of the true one.

SketchPolygon

struct SketchPolygon

A regular polygon added to a sketch, as Sketch::add_polygon() returns it: plain data. centre is the centre point's id, circumcircle and incircle the two construction circles', corners the corner points' ids and sides the side lines' ids (side k runs corner k to corner k + 1).

SketchChamfer

struct SketchChamfer

What Sketch::chamfer() and Sketch::chamfer_angle() added, as plain data: line the new line's id, points the ids of its two ends (on a, then on b), corner the old corner point, kept as the virtual sharp, and dimensions the two driving dimensions (along a, then along b or the angle).

SketchPattern

struct SketchPattern

What Sketch::pattern_rectangular() and Sketch::pattern_circular() added, as plain data: copies one list of entity ids per copy (the source excluded, each in the order of the source entities; rectangular copies row by row, the first direction fastest), steps the construction lines of a circular pattern (two, none for a rectangular one) and dimensions the driving dimensions (rectangular: the first step's horizontal and vertical distances, then the second's where it is used; circular: the step angle).

SketchMirror

struct SketchMirror

What Sketch::mirror() added, as plain data: copies one entity id per source entity, in their order (for a point on the line, the point itself), and constraints the constraints holding the copies to their sources (symmetric about the line, equal radius for circles and arcs, point on line for a shared point).

PatchReport

struct PatchReport

How well an N-sided patch meets — Solid::patch_report(), measured with Solid::continuity() on every neighbour and every spoke.

PatchReport::faces

std::uint32_t faces

How many faces: one per side of the hole.

PatchReport::boundary

Continuity boundary

The worst Continuity against the neighbours: the gap over every side, the angle over those met at G1 or G2, the curvature over those met at G2.

PatchReport::internal

Continuity internal

The worst Continuity across the patch's own spokes.

PatchReport::corner_angle

double corner_angle

The largest angle, in radians, between a boundary's tangent at a corner of the hole and the neighbour before it's tangent plane: what no patch can meet there, 0 where the neighbours meet each other at G1.

Curvature

struct Curvature

A curve's bending at a parameter — what NurbsCurve::curvature() returns.

Curvature::kappa

double kappa

The curvature, 1 / radius; 0 on a straight piece.

Curvature::tangent

Vec3 tangent

The unit tangent, along increasing parameter.

Curvature::normal

Vec3 normal

The unit normal toward the centre of curvature; zero on a straight piece.

Curvature::binormal

Vec3 binormal

tangent x normal; zero on a straight piece.

Curvature::centre

std::optional<Vec3> centre

The centre of the osculating circle, or std::nullopt on a straight piece.

At

struct At

A point at arc length — what Solid::edge_point_at_length() and Profile::point_at_length() return, and each sample of the divides — beside an estimate of how far its arc length can be trusted.

At::point

Vec3 point

The point.

At::tangent

Vec3 tangent

The unit tangent there, along the edge or loop; zero where the curve stops.

At::parameter

double parameter

The curve's own parameter at the point: on an edge, its curve's (a circle's angle, a line's fraction); on a profile, its side's (a line's 0 to 1, an arc's angle about its centre — a clockwise arc's decreasing along it — a spline's parameter).

At::segment

std::optional<std::uint32_t> segment

On a profile, the side the point lies on: its segment's index, or the segment count for the implicit closing side. Empty on an edge (None in Python, CADACLYSM_BLACKSMITH_NONE in C).

At::error

double error

An estimate of how far the true arc length to the point is from the s asked for: the length's error up to it plus the inversion's own residual.

At::from_polyline

bool from_polyline

The curve was a sampled polyline: exact for its points and not for whatever they were sampled from.

Classifier

class Classifier

A closed solid meshed once and asked where point after point lies: what Solid::classifier() returns. It keeps its own reference to the body. Calls on one classifier take turns (a lock inside the library), so build one per thread to classify in parallel.

Classifier::contains()

Result<std::string> contains(const Vec3& point) const

Where point is: inside, outside, or on within the tolerance of the boundary. A point not finite returns an Error in its Result.

Classifier::close()

void close() noexcept

Free the handle. Leaving a with block or the garbage collector does the same.

Projector

class Projector

A solid meshed once and asked for its nearest point to point after point: what Solid::projector() returns. It keeps the mesh, its search tree and each face's trim judge between queries, and its own reference to the body. Calls on one projector take turns (a lock inside the library), so build one per thread to ask in parallel.

Projector::closest_point()

Result<std::optional<PointFoot>> closest_point(const Vec3& p, std::optional<double> max_distance = std::nullopt) const

The nearest point of the body's boundary to p, as a PointFoot, or std::nullopt beyond max_distance — Solid::closest_point()'s answer, at the projector's tolerance. A point not finite or a negative max_distance returns an Error in its Result.

Projector::curve_closest_points()

Result<std::optional<CurveBodyFoot>> curve_closest_points(const NurbsCurve& curve, std::optional<double> max_distance = std::nullopt) const

The nearest points of curve and the body's boundary, as a CurveBodyFoot, or std::nullopt beyond max_distance — Solid::curve_closest_points()'s answer, at the projector's tolerance. The projector's lock is held for the whole curve query: other threads asking this projector, for points or curves, wait for it. A negative max_distance or a curve too long for the tolerance returns an Error in its Result.

Projector::close()

void close() noexcept

Free the handle. Leaving a with block or the garbage collector does the same.

PointFoot

struct PointFoot

The nearest point of a solid, or of one face, to a query point, as a named tuple: what Solid::closest_point(), Projector::closest_point() and Solid::face_closest_point() return. point lies on the boundary and distance is from the query point to it. What the point lies on is named as Closest names each side: kind is "face", "edge" or "vertex", index the kernel's id for it, and edge the index Solid::edges() uses for an edge foot — what Solid::edge_length(), Solid::fillet() and Solid::edge_closest_point() take, so read edge, not index, for the public edge number — none for a face, a vertex, and an edge the fillet table does not hold. uv is the face parameter of a foot inside a face, none for an edge or a vertex foot. normal is unit: a face foot's outward normal; an edge or vertex foot's direction from the foot to the query point; on the body (distance 0) the mean of the adjacent faces' outward normals. refined is true when the foot was refined onto the exact geometry: distance is then never below the true minimum and within the tolerance of it; false is the mesh's answer, within [d - 2/3 tolerance, d + tolerance] of the true minimum d.

CurvePair

struct CurvePair

The nearest points of two curves, as a named tuple: what NurbsCurve::closest_points() returns, and a NearestObject's answer for a curve. point_a lies on the curve asked at its parameter t_a, point_b on the other at t_b, distance apart (0 where they cross). Exact.

CurveBodyFoot

struct CurveBodyFoot

The nearest points of a curve and a solid's boundary, as a named tuple: what Solid::curve_closest_points() and Projector::curve_closest_points() return, and a NearestObject's answer for a solid or a projector. point_on_curve lies on the curve at its parameter t, point_on_body on the boundary, distance apart. crossing is true where the curve passes through the boundary: distance is then exactly 0 and the earliest crossing in t answers. The body's side is the point query's foot at point_on_curve, named as PointFoot names it: kind, index the kernel's id, and edge the index Solid::edges() uses for an edge foot (read edge, not index, for the public edge number; none otherwise), uv none off a face, normal unit. refined false is the mesh's answer, within [d - 2/3 tolerance, d + tolerance] of the true minimum d.

NearestObject

struct NearestObject

The nearest of a list of things to a curve, as a named tuple: what NurbsCurve::closest_object() returns. which is the item's index in the list, distance from point_on_curve (at the curve's parameter t) to point_on_item. answer is the item's own answer: a CurveBodyFoot for a solid or a projector, a CurvePair (side a the curve asked) for a curve, a CurveMeshFoot for a TriangleMesh, a CurveSurfaceFoot for a NurbsSurface, none for a point.

TriangleMesh

class TriangleMesh

A triangle mesh and its search tree, built once and immutable: nearest points and nearest points to a curve are answered exactly against it — no tolerance, no refined figure. TriangleMesh(positions, indices) takes the vertices and the triangles (three vertex indices each, any winding), each as a sequence of triples, one flat sequence, or an array; both are copied. A zero-area triangle is accepted and answers as its longest edge. Solid::triangle_mesh() gives a solid's own. No triangles, an index past the vertex count, or a coordinate that is not finite returns an Error in its Result. Nothing in it changes after it is built, so calls on one mesh from several threads at once are safe and do not take turns. Close it when done, or let the language's scope do it; see Lifetimes.

TriangleMesh::vertex_count()

Result<std::uint32_t> vertex_count() const

How many vertices the mesh holds.

TriangleMesh::triangle_count()

Result<std::uint32_t> triangle_count() const

How many triangles the mesh holds.

TriangleMesh::bounds()

Result<::cadaclysm::Bounds64> bounds() const

The box of every vertex, as (min, max).

TriangleMesh::closest_point()

Result<std::optional<MeshPoint>> closest_point(const Vec3& p, std::optional<double> max_distance = std::nullopt) const

The nearest point of the mesh to p, as a MeshPoint — exact, the lower triangle where several share the point — or std::nullopt where it lies beyond max_distance (none, NaN or infinite: no limit; a point on the mesh is within 0). A point not finite or a negative max_distance returns an Error in its Result.

TriangleMesh::curve_closest_points()

Result<std::optional<CurveMeshFoot>> curve_closest_points(const NurbsCurve& curve, std::optional<double> max_distance = std::nullopt) const

The nearest points of curve and the mesh, as a CurveMeshFoot, or std::nullopt where the mesh lies farther than max_distance (none, NaN or infinite: no limit). Exact. Where the curve passes through a triangle the answer is a crossing, distance exactly 0, at the earliest crossing in t; among equal distances the lower triangle, then the lower t, answers. A mesh has no inside: a curve within a closed mesh answers its distance to the triangles. A curve that is not valid or a negative max_distance returns an Error in its Result.

TriangleMesh::close()

void close() noexcept

Free this handle now. Leaving a with block or the garbage collector does the same.

MeshPoint

struct MeshPoint

The nearest point of a TriangleMesh to a query point: what TriangleMesh::closest_point() returns. Exact.

MeshPoint::point

Vec3 point

The point on the mesh.

MeshPoint::distance

double distance

The distance from the query point to point.

MeshPoint::triangle

std::uint32_t triangle

The lowest-numbered triangle holding the point: on an edge or a vertex several triangles share, the lower triangle answers.

MeshPoint::barycentric

std::array<double, 3> barycentric

The point's three weights on triangle's corners, in index order, summing to 1.

MeshPoint::kind

std::string kind

What the point lies on: "face" (inside triangle), "edge" or "vertex".

MeshPoint::vertices

std::vector<std::uint32_t> vertices

What kind names: an edge's two vertex indices ascending, a vertex's one, none for a face.

CurveMeshFoot

struct CurveMeshFoot

The nearest points of a curve and a TriangleMesh: what TriangleMesh::curve_closest_points() returns, and a NearestObject's answer for a mesh. Exact. The mesh's side is named as MeshPoint names it, flat.

CurveMeshFoot::distance

double distance

The distance from point_on_curve to point_on_mesh.

CurveMeshFoot::t

double t

The curve's parameter at point_on_curve.

CurveMeshFoot::point_on_curve

Vec3 point_on_curve

The point on the curve.

CurveMeshFoot::point_on_mesh

Vec3 point_on_mesh

The point on the mesh.

CurveMeshFoot::triangle

std::uint32_t triangle

The lowest-numbered triangle holding point_on_mesh.

CurveMeshFoot::barycentric

std::array<double, 3> barycentric

point_on_mesh's three weights on triangle's corners, in index order, summing to 1.

CurveMeshFoot::kind

std::string kind

What point_on_mesh lies on: "face", "edge" or "vertex".

CurveMeshFoot::vertices

std::vector<std::uint32_t> vertices

What kind names: an edge's two vertex indices ascending, a vertex's one, none for a face.

CurveMeshFoot::crossing

bool crossing

true where the curve passes through a triangle: distance is then exactly 0, at the earliest crossing in t. A curve that touches without passing through is distance 0 and false.

NurbsSurface

class NurbsSurface

An untrimmed NURBS surface, immutable: nearest points and nearest points to a curve are answered exactly against it — no tolerance, no refined figure. NurbsSurface(points, counts, degree_u, degree_v, weights, knots_u, knots_v) takes the control net of counts = (n_u, n_v) points, rows along u (point i * n_v + j is row i, column j), as a sequence of triples, one flat sequence, or an array; degrees 1 to 7 (3 by default); weights one per point, positive and finite, or none for a plain B-spline; and the full clamped knot vectors (n + degree + 1 values each, non-decreasing, the first and the last degree + 1 equal), or none for clamped and uniform over [0, 1]. Everything is copied. Solid::face_surface() gives a face's own. A degree out of range, too few points for a degree, a point that is not finite, a bad weight, or knots of the wrong count, decreasing or not clamped returns an Error in its Result. Its Bézier patches are cut once, at the first query, and kept; nothing else in it changes, so calls on one surface from several threads at once are safe. Close it when done, or let the language's scope do it; see Lifetimes.

NurbsSurface::degree_u()

Result<std::uint32_t> degree_u() const

The degree along u.

NurbsSurface::degree_v()

Result<std::uint32_t> degree_v() const

The degree along v.

NurbsSurface::counts()

Result<std::pair<std::uint32_t, std::uint32_t>> counts() const

The control net's size, (n_u, n_v).

NurbsSurface::domain()

Result<std::pair<std::pair<double, double>, std::pair<double, double>>> domain() const

The parameter domain, ((u0, u1), (v0, v1)).

NurbsSurface::point_at()

Result<Vec3> point_at(double u, double v) const

The point at (u, v). A parameter outside the domain or not finite returns an Error in its Result.

NurbsSurface::normal_at()

Result<Vec3> normal_at(double u, double v) const

The unit normal at (u, v) (dS/du x dS/dv, normalised). A parameter outside the domain or not finite, or a place where the partials are parallel (a pole — exactly where a SurfacePoint's normal is zero), returns an Error in its Result.

NurbsSurface::to_sheet()

Result<Solid> to_sheet() const

The whole surface as an open one-face sheet Solid. The sheet's face is this surface reparametrised over [0, 1] x [0, 1]: its Solid::face_surface() has that domain, not this one's. A surface of no size returns an Error in its Result.

NurbsSurface::closest_point()

Result<std::optional<SurfacePoint>> closest_point(const Vec3& p, std::optional<double> max_distance = std::nullopt) const

The nearest point of the surface to p, as a SurfacePoint — exact, the lower u, then the lower v, among equal distances — or std::nullopt where it lies beyond max_distance (none, NaN or infinite: no limit; a point on the surface is within 0). A point not finite or a negative max_distance returns an Error in its Result.

NurbsSurface::curve_closest_points()

Result<std::optional<CurveSurfaceFoot>> curve_closest_points(const NurbsCurve& curve, std::optional<double> max_distance = std::nullopt) const

The nearest points of curve and the surface, as a CurveSurfaceFoot, or std::nullopt where the surface lies farther than max_distance (none, NaN or infinite: no limit). Exact. Where the curve passes through the surface the answer is a crossing, distance exactly 0, at the earliest crossing in t; among equal distances the lower u, then v, then t, answers. A curve that is not valid or a negative max_distance returns an Error in its Result.

NurbsSurface::control_points()

Result<std::vector<Vec3>> control_points() const

The control net, n_u * n_v points, row i (along u) point j at i * n_v + j — the order the constructor takes them in.

NurbsSurface::weights()

Result<std::vector<double>> weights() const

The weights, one per control point in the net's order (all 1 for a plain B-spline).

NurbsSurface::knots()

Result<std::vector<double>> knots(SurfaceDirection direction) const

The full knot vector along direction ("u" or "v"): n + degree + 1 values. Another direction returns an Error in its Result.

direction is a SurfaceDirection, SurfaceDirection::u or SurfaceDirection::v, not a string.

NurbsSurface::elevate()

Result<NurbsSurface> elevate(SurfaceDirection direction, std::uint32_t by = 1) const

The same surface, exactly, raised by degrees (1 by default) along direction (to at most 12; Rhino's IncreaseDegreeU/V).

direction is a SurfaceDirection, SurfaceDirection::u or SurfaceDirection::v, not a string.

NurbsSurface::insert_knot()

Result<NurbsSurface> insert_knot(SurfaceDirection direction, double t, std::uint32_t times = 1) const

The same surface, exactly, with the knot t (strictly inside the domain) inserted times times along direction: more control points, every point kept. A t outside the domain, a times of 0, or a multiplicity past the degree, returns an Error in its Result.

direction is a SurfaceDirection, SurfaceDirection::u or SurfaceDirection::v, not a string.

NurbsSurface::refine_knots()

Result<NurbsSurface> refine_knots(SurfaceDirection direction, const std::vector<double>& knots) const

The same surface, exactly, with every knot of knots (non-decreasing, each strictly inside the domain, no multiplicity past the degree) inserted along direction.

direction is a SurfaceDirection, SurfaceDirection::u or SurfaceDirection::v, not a string.

NurbsSurface::remove_knot()

Result<std::pair<NurbsSurface, std::uint32_t>> remove_knot(SurfaceDirection direction, double t, std::uint32_t times = 1, std::optional<double> tolerance = std::nullopt) const

Up to times copies of the inner knot t along direction removed, each only while every row of the net stays within tolerance (an absolute length; none, 0 or NaN: the net's effective tolerance) of itself: the surface and how many went — 0, and an unchanged copy, where none could. A t that is not an inner knot, or a negative tolerance, returns an Error in its Result.

direction is a SurfaceDirection, SurfaceDirection::u or SurfaceDirection::v, not a string. Answers a std::pair of the new handle and the count.

NurbsSurface::extend()

Result<NurbsSurface> extend(SurfaceSide side, double length) const

The surface continued length past side ("u_start", "u_end", "v_start" or "v_end"; Rhino's Surface.Extend) along its own end polynomials — curvature-continuous, every old (u, v) keeping its point, the domain grown on that side. Another side, or a length that is not positive and finite, returns an Error in its Result.

side is a SurfaceSide: SurfaceSide::u_start, u_end, v_start or v_end.

NurbsSurface::offset()

Result<NurbsSurface> offset(double distance, std::optional<double> tolerance = std::nullopt) const

This surface moved distance along its normal, as Rhino's Surface.Offset, over the same domain: its point at (u, v) within tolerance (none: the effective tolerance) of this one's point there moved distance along the normal. A plane offsets exactly (fit_error 0); any other surface is refitted, fit_error bounding the distance from the exact offset. The result holds the offset's values, not a reference back to this surface. A distance that is not finite, a surface with no normal somewhere, or an offset that folds over (a curvature radius used up) returns an Error in its Result.

NurbsSurface::fit_error()

const std::optional<double>& fit_error() const noexcept

On a surface from NurbsSurface::offset(), the largest distance found between it and the exact offset; std::nullopt on any other.

NurbsSurface::second_derivatives()

Result<SurfaceDerivatives> second_derivatives(double u, double v) const

The point and its partial derivatives to second order at (u, v): (S, Su, Sv, Suu, Suv, Svv) (Rhino's Surface.Evaluate to order 2). A parameter outside the domain or not finite returns an Error in its Result.

Answers a SurfaceDerivatives: point, du, dv, duu, duv, dvv, each a Vec3.

NurbsSurface::curvature()

Result<SurfaceCurvature> curvature(double u, double v) const

The principal, Gaussian and mean curvatures and the principal directions at (u, v), as a SurfaceCurvature (Rhino's Surface.CurvatureAt). A parameter outside the domain or not finite, or a pole (no normal), returns an Error in its Result.

NurbsSurface::hermite()

static Result<NurbsSurface> hermite(const std::vector<double>& u, const std::vector<double>& v, const std::vector<Vec3>& points, const std::vector<Vec3>& du, const std::vector<Vec3>& dv, const std::vector<Vec3>& twists)

The bicubic Hermite surface through a grid (Rhino's HermiteSurface): u (at least 2) and v (at least 2) the grid's parameters, strictly rising; points, du, dv and twists a point for each node, node (i, j) at i * len(v) + j — its point, dS/du, dS/dv and d2S/dudv. Cubic both ways with a double knot at every inner grid parameter (C1 across), 2 len(u) x 2 len(v) control points, through every point with the given derivatives. A grid under 2 x 2, parameters not strictly rising, lists of the wrong length or numbers not finite returns an Error in its Result.

NurbsSurface::close()

void close() noexcept

Free this handle now. Leaving a with block or the garbage collector does the same.

SurfacePoint

struct SurfacePoint

The nearest point of a NurbsSurface to a query point: what NurbsSurface::closest_point() returns. Exact.

SurfacePoint::point

Vec3 point

The point on the surface.

SurfacePoint::distance

double distance

The distance from the query point to point.

SurfacePoint::u

double u

The surface's u parameter at point: among equal distances the lower u, then the lower v, answers.

SurfacePoint::v

double v

The surface's v parameter at point.

SurfacePoint::normal

Vec3 normal

The surface's unit normal at (u, v) (dS/du x dS/dv), or the zero vector where it has none: a pole, where the partials are parallel.

SurfacePoint::boundary

bool boundary

true where point lies on an edge of the patch (u or v at an end of the domain) and the way to the query point is not along the normal: the edge, not the surface's interior, is what is nearest.

SurfaceCurvature

struct SurfaceCurvature

How a NurbsSurface bends at a point: what NurbsSurface::curvature() returns, from its first and second fundamental forms. Every curvature is signed about normal: positive where the surface bends toward it. A cylinder of radius r reads one curvature 0 and the other -1/r or 1/r, by which way the normal points.

SurfaceCurvature::k1

double k1

The larger principal curvature (k1 >= k2).

SurfaceCurvature::k2

double k2

The smaller principal curvature.

SurfaceCurvature::dir1

Vec3 dir1

The unit tangent direction of k1; at an umbilic (k1 == k2) any orthonormal pair with dir2.

SurfaceCurvature::dir2

Vec3 dir2

The unit tangent direction of k2.

SurfaceCurvature::gaussian

double gaussian

The Gaussian curvature, k1 * k2.

SurfaceCurvature::mean

double mean

The mean curvature, (k1 + k2) / 2.

SurfaceCurvature::normal

Vec3 normal

The unit normal the signs are taken about, dS/du x dS/dv normalised.

CurveSurfaceFoot

struct CurveSurfaceFoot

The nearest points of a curve and a NurbsSurface: what NurbsSurface::curve_closest_points() returns, and a NearestObject's answer for a surface. Exact. The surface's side is named as SurfacePoint names it, flat.

CurveSurfaceFoot::distance

double distance

The distance from point_on_curve to point_on_surface.

CurveSurfaceFoot::t

double t

The curve's parameter at point_on_curve.

CurveSurfaceFoot::point_on_curve

Vec3 point_on_curve

The point on the curve.

CurveSurfaceFoot::point_on_surface

Vec3 point_on_surface

The point on the surface.

CurveSurfaceFoot::u

double u

The surface's u parameter at point_on_surface.

CurveSurfaceFoot::v

double v

The surface's v parameter at point_on_surface.

CurveSurfaceFoot::normal

Vec3 normal

The surface's unit normal at (u, v), or the zero vector at a pole.

CurveSurfaceFoot::boundary

bool boundary

true where point_on_surface lies on an edge of the patch and the way to the curve is not along the normal.

CurveSurfaceFoot::crossing

bool crossing

true where the curve passes through the surface: distance is then exactly 0, at the earliest meeting in t. A curve that touches without passing through is distance 0 and false.

Closest

struct Closest

The closest points between two solids' boundaries: what Solid::closest() returns, side a the solid asked and side b the other. Each side names the feature its point lies on.

Closest::distance

double distance

The distance between the two points.

Closest::on_a

Vec3 on_a

The point on side a.

Closest::on_b

Vec3 on_b

The point on side b.

Closest::kind_a

std::string kind_a

What side a's point lies on: "face", "edge" or "vertex".

Closest::index_a

std::uint32_t index_a

The kernel's id for side a's feature.

Closest::edge_a

std::optional<std::uint32_t> edge_a

Side a's edge as the index Solid::edges() uses; none for a face or a vertex, and for an edge the fillet table does not hold (a trim with no exact curve).

Closest::kind_b

std::string kind_b

What side b's point lies on: "face", "edge" or "vertex".

Closest::index_b

std::uint32_t index_b

The kernel's id for side b's feature.

Closest::edge_b

std::optional<std::uint32_t> edge_b

Side b's edge, as edge_a.

Closest::refined

bool refined

A refined answer is never below the true minimum and within the tolerance of it wherever the face pair holding the minimum refines to its own nearest pair. Where a nearer candidate did not converge, or left its trims and its boundary search found nothing, the mesh's answer comes back instead with refined false: within [d - 2/3 tolerance, d + tolerance] of the true minimum d.

Beziers

What Solid::silhouette_beziers() returns: curves as cubic Béziers in double precision, four control points and four weights a curve. Unlike the reader's Beziers, the arrays are the wrapper's own — the kernel hands its buffer over and the wrapper releases it before the call returns — so there is nothing to outlive; they are read-only views over one copy kept alive by the arrays themselves.

Solid::silhouette_beziers returns the reader's cadaclysm::BeziersData64.

Beziers.points

Four control points a curve, three doubles each: shape (count, 4, 3).

Solid::silhouette_beziers returns the reader's cadaclysm::BeziersData64.

Beziers.weights

A weight per control point, as doubles: shape (count, 4). All ones for a polynomial curve, and the weights that make a circular arc exact for a rational one.

Solid::silhouette_beziers returns the reader's cadaclysm::BeziersData64.

Beziers.count

How many curves. A Beziers is falsey when this is 0, the empty answer.

Solid::silhouette_beziers returns the reader's cadaclysm::BeziersData64.

Beziers.copy

The same arrays, writable and contiguous, in memory of your own.

Solid::silhouette_beziers returns the reader's cadaclysm::BeziersData64.

Hlr

class Hlr

A hidden-line view of solids or meshes: what Hlr::of() and Hlr::of_meshes() return. Its lines, each seen or hidden, what the removal did, and the tolerance it worked at; placed on a drawing with Page::add_view(). Immutable. It holds a handle of the library's, freed as Lifetimes describes.

Hlr::lines()

const std::vector<HlrLine>& lines() const noexcept

Every line, seen and hidden, as HlrLines.

Hlr::visible()

std::vector<HlrLine> visible() const

The lines seen.

Hlr::hidden()

std::vector<HlrLine> hidden() const

The lines hidden: a drawing's dashed ones.

Hlr::report()

const HlrReport& report() const noexcept

What the removal did, as counts and lengths: candidates (curves considered), segments (the view-plane Béziers they projected to), crossings, pieces (pieces classified), degenerate (pieces shorter than the tolerance on the view plane, an edge seen end-on: not drawn), rays, mesh_hits, rejected, grazes, unsettled (pieces the evidence could not settle, decided by two more samples), mesh_only (hits taken on the mesh's word, a face with no readable trims), fallback_edges (edges with no exact curve, drawn from their polyline), failed_solids (solids that could not be placed or meshed, and so neither draw nor hide), candidate_length and degenerate_length (lengths in space). A dictionary in Python; the typed wrappers' report has the same fields in their own spelling.

Hlr::tolerance()

double tolerance() const noexcept

The tolerance the view was worked at, in model units: the one asked for, or the effective tolerance it resolved to.

HlrLine

struct HlrLine

One line of an Hlr, as a named tuple: kind ("sharp", "smooth", "outline", "iso" or "boundary"), visible, solid the index of the solid (or mesh) it belongs to in the list given, and source, what it is a span of — ("edge", id), ("face", index) for a silhouette or an isocurve, or ("mesh_edge", a, b), a mesh edge's two vertices. Its curve is beziers2d, rational cubic Béziers on the view plane (z 0), and beziers3d, the same spans in space, Bézier for Bézier, each a Beziers; length2d is its length on the view plane and length3d in space, in model units.

Page

class Page

A flat drawing page: hidden-line views, profiles, hatches and text placed on it, written as SVG or as DXF R2000 (AC1015) that CAD programs open. Page(units) makes an empty one in millimetres (the default), centimetres, metres, inches, feet or no unit, written into the DXF's header. Layers are made on first use: a view's own — visible (seen sharp and boundary edges, 0.5 mm), outline (seen silhouettes, 0.5 mm), smooth (0.25 mm, grey), iso (0.18 mm, grey) and hidden (every hidden line, dashed, 0.25 mm) — and any other name continuous, colour 7. Mutable: each add_* changes the page. It holds a handle of the library's, freed as Lifetimes describes.

Page::add_view()

Result<void> add_view(const Hlr& view, const std::array<double, 2>& at = {0.0, 0.0}, double scale = 1.0)

A view's lines (Hlr) on the page, a view point p landing at at + scale * p: each line as the entities that draw it best — lines, arcs, circles, elliptical arcs, splines — on the view's layers.

Page::add_profile()

Result<void> add_profile(const Profile& profile, const std::array<double, 2>& at = {0.0, 0.0}, const std::optional<std::string>& layer = std::nullopt)

A Profile's outline and holes on layer (std::nullopt: 0), moved by at.

Page::add_hatch()

Result<void> add_hatch(const Profile& profile, const std::string& pattern = "ANSI31", double angle = 0.0, double scale = 1.0, const std::array<double, 2>& at = {0.0, 0.0}, const std::optional<std::string>& layer = std::nullopt)

A Profile hatched, its holes left out, on layer (std::nullopt: hatch), moved by at: pattern SOLID, ANSI31, ANSI37 or ANSI32 (also STEEL), any case, turned angle radians, its spacing times scale. Another pattern name returns an Error in its Result.

Page::add_text()

Result<void> add_text(const std::string& text, const std::array<double, 2>& at, double height, double angle = 0.0, const std::string& halign = "left", const std::string& valign = "baseline", const std::optional<std::string>& layer = std::nullopt)

One line of text on layer (std::nullopt: text) at at, height tall, turned angle radians; halign left (default), center or right, valign baseline (default), bottom, middle or top.

Page::add_flat_pattern()

Result<void> add_flat_pattern(const FlatPattern& flat, const std::array<double, 2>& at = {0.0, 0.0}, bool extents = true, bool table = false, bool labels = true, bool notes = false, bool dimensions = false, bool folded = false)

A FlatPattern at at, 1:1: the outline on layer OUTLINE, each bend line on BEND_UP (green) or BEND_DOWN (red); extents adds the zones' edges on BEND_EXTENT, table a ruled table of the bends under the outline on BEND_TABLE (number, direction, angle, inner radius, K-factor, allowance, deduction), labels a label on each bend line, notes a bend note under each (UP 90° R1) on BEND_NOTE, dimensions the flat's overall width and height on DIMENSION (lines, arrowheads and text), and folded the folded part's front view right of the flat, at its scale, on FOLDED and FOLDED_HIDDEN.

Page::svg()

Result<std::string> svg() const

The page as an SVG document, one group per layer.

Page::dxf()

Result<std::string> dxf() const

The page as DXF R2000 (AC1015) text: the same text for the same page. cadaclysm::blacksmith::dxf_profiles() reads its closed loops back.

Box

struct Box

An axis-aligned box: lo and hi, three numbers each. The broad phase's own shape (Solid::bounds_box(), Collider's own boxes): cheap to move and to test against another before anything is meshed.

Box::lo

Vec3 lo

The box's low corner.

Box::hi

Vec3 hi

The box's high corner.

Box::move()

Result<Box> move(const Frame& frame) const

This box moved by frame (rigid), boxed again on the world axes — not this box's corners individually moved, which would not in general be a box at all: the *bounding* box of the moved corners. A frame not twelve finite numbers or not rigid returns an Error in its Result.

Box::overlaps()

bool overlaps(const Box& other) const

Whether this box and other share a point (touching counts).

Region

struct Region

One region of space a solid's faces bound, as Solid::regions() returns it: a value, equal by value, that does not change. Solid::region_solid() takes a finite one as a solid of its own.

Region::index

std::uint32_t index

Its index in Solid::regions(): 0 for the infinite region.

Region::finite

bool finite

false for region 0, the one reaching to infinity; true for every other.

Region::box

Box box

The Box round the faces bounding it.

Region::sides

std::vector<FaceSide> sides

Every face side bounding it, as FaceSide values, ascending by face and then sense (-1 first).

Region::shells

std::uint32_t shells

How many connected boundaries it has: 1, plus one per void inside it.

FaceSide

struct FaceSide

One side of one face, as a Region lists its sides: a value, equal by value.

FaceSide::face

std::uint32_t face

The face's index in the solid.

FaceSide::sense

std::int32_t sense

+1 for the side the face's normal points to, -1 for the other. A solid's inside is behind its faces, at -1.

ColliderStats

struct ColliderStats

Counts of one Collider::check() call, as Collider::stats() returns them (all zero before the first call): the candidate pairs considered, how many of them the world boxes and the oriented boxes cleared, how many the share left to another call, how the rest were answered (cached, closed_form, meshed), and how many were refused. confirmed is the subset of meshed that were thin mesh-path overlaps sent to Solid::common() itself for a final answer.

ColliderStats::considered

std::uint32_t considered

The candidate pairs looked at: every pair of parts in different groups, less any in allowed or skipped_share.

ColliderStats::world_boxes

std::uint32_t world_boxes

Of those, how many two world boxes (Box::overlaps()) cleared at once — decided apart with no oriented test.

ColliderStats::oriented_boxes

std::uint32_t oriented_boxes

Of the rest, how many cadaclysm::blacksmith::boxes_apart() cleared — decided apart on the parts' own oriented boxes.

ColliderStats::skipped_share

std::uint32_t skipped_share

Pairs this call's share left to another call, not decided here at all.

ColliderStats::cached

std::uint32_t cached

Pairs answered from an earlier pose's cache rather than worked afresh.

ColliderStats::closed_form

std::uint32_t closed_form

Pairs decided by an exact formula (both parts a shape the kernel has one for), no mesh built.

ColliderStats::meshed

std::uint32_t meshed

Pairs that needed a mesh-against-mesh test to decide.

ColliderStats::refused

std::uint32_t refused

Pairs that could not be decided at all — each a CollisionHit with kind "refused".

ColliderStats::confirmed

std::uint32_t confirmed

Of meshed, how many thin mesh-path overlaps were sent on to Solid::common() itself for a final answer.

CollisionHit

class CollisionHit

One pair Collider::check() found overlapping (kind "overlap"), or could not decide (kind "refused", text says why), as plain data. positions/normals are world xyz triples, three per triangle (unwelded); indices indexes them — all empty for a refused pair. depth is the thinnest side of the overlap's world box, 0 for a refused pair.

CollisionHit::solid() rebuilds the exact overlap now, from the frames Collider::check() found it at; this keeps the check call's own answer alive behind every hit of it until the last one is let go, freeing it only then.

CollisionHit::a

std::uint32_t a

The first part's index, as given to Collider.

CollisionHit::b

std::uint32_t b

The second part's index.

CollisionHit::kind

std::string kind

"overlap" or "refused".

CollisionHit::overlap

bool overlap

The same answer as kind, as a plain bool.

CollisionHit::depth

double depth

The thinnest side of the overlap's world box; 0 for a refused pair.

CollisionHit::text

std::string text

Why a refused pair could not be decided; empty for an overlap.

CollisionHit::positions

std::vector<Vec3> positions

The overlap solid's mesh positions, world xyz triples, three per triangle (unwelded); empty for a refused pair.

CollisionHit::normals

std::vector<Vec3> normals

The overlap solid's mesh normals, matching positions; empty for a refused pair.

CollisionHit::indices

std::vector<std::uint32_t> indices

Indices into positions/normals; empty for a refused pair.

CollisionHit::solid()

Result<Solid> solid() const

The exact overlap of this pair at the frames Collider::check() found it at, as a new Solid. returns an Error in its Result for a refused pair (kind "refused") or a check answer already closed some other way.

Clash

class Clash

One pair cadaclysm::blacksmith::clash() or Collider::clash() found, as plain data. kind is "penetrating" (the volumes overlap), "touching" (the boundaries are within the tolerance of each other), "too_close" (apart by more than the tolerance but less than the clearance) or "refused" (the pair could not be decided; text says why). The feature fields are Closest's, flat: what each point lies on, by the kernel's id and the Solid::edges() index; for a penetrating or refused pair there is no closest point, so kind_a and kind_b are "none" and index_* and edge_* are none.

Clash::solid() and Clash::intersect() are built on demand, from the placement the pair was found at; the answer of the call that found the rows is kept alive behind every row of it until the last one is let go, freeing it only then.

Clash::a

std::uint32_t a

The first part's index: in the one set, or in the collider (then a < b); in clash with two sets, an index into parts.

Clash::b

std::uint32_t b

The second part's index; with two sets, an index into others.

Clash::kind

std::string kind

"penetrating", "touching", "too_close" or "refused".

Clash::distance

double distance

The gap between the two boundaries; 0 for a penetrating or refused pair.

Clash::on_a

Vec3 on_a

A world point on part a: the closest of the pair; for a penetrating pair the centre of the overlap's world box; the origin for a refused one.

Clash::on_b

Vec3 on_b

The matching world point on part b, as on_a.

Clash::kind_a

std::string kind_a

What on_a lies on, as Closest::kind_a: "face", "edge" or "vertex"; "none" for a penetrating or refused pair.

Clash::index_a

std::optional<std::uint32_t> index_a

The kernel's id for part a's feature; none for a penetrating or refused pair.

Clash::edge_a

std::optional<std::uint32_t> edge_a

Part a's edge as the index Solid::edges() uses, as Closest::edge_a; none for a face, a vertex, an edge the fillet table does not hold, and a penetrating or refused pair.

Clash::kind_b

std::string kind_b

What on_b lies on, as kind_a.

Clash::index_b

std::optional<std::uint32_t> index_b

The kernel's id for part b's feature, as index_a.

Clash::edge_b

std::optional<std::uint32_t> edge_b

Part b's edge, as edge_a.

Clash::refined

bool refined

Whether the distance was measured on the exact surfaces, as Closest::refined; false for a penetrating or refused pair.

Clash::depth

double depth

The thinnest side of a penetrating pair's overlap box; 0 for any other.

Clash::text

std::string text

Why a refused pair could not be decided; empty otherwise.

Clash::solid()

Result<Solid> solid() const

The exact shared volume of this penetrating pair, at the placement it was found at, as a new Solid. returns an Error in its Result for a pair that is not penetrating.

Clash::intersect()

Result<Intersection> intersect() const

Where this pair's two parts cross or coincide at the placement it was found at, as Solid::intersect() reports it: a touching pair's shared face is an overlap region. returns an Error in its Result for a refused pair.

SweptClash

struct SweptClash

One pair cadaclysm::blacksmith::swept_clash() or Collider::swept_clash() found to clash somewhere on the path, as plain data: when it first came within the clearance, the Clash there, and every time range it stays in clash. Times are in pose units: pose k is at time k, and a time between two poses is the fraction of the way from one to the next.

SweptClash::a

std::uint32_t a

The first part's index: in the one set, or in the collider (then a < b); in swept_clash with two sets, an index into parts.

SweptClash::b

std::uint32_t b

The second part's index; with two sets, an index into others.

SweptClash::first_time

double first_time

The first time the pair came within the clearance, found to within the tolerance over the pair's speed; for a refused pair, the time it was refused at.

SweptClash::first

Clash first

The Clash at first_time — its kind, distance, points, features and depth — at the frames the motion places the two parts at that time, so its Clash::solid() and Clash::intersect() rebuild the contact there. A pair refused on the way (a part that will not mesh closed, or more than max_steps tests) has a "refused" first, whose text says why.

SweptClash::intervals

std::vector<std::pair<double, double>> intervals

The time ranges the pair stays in clash, as (start, end) pairs, ascending and disjoint; the first starts at first_time. An end is found to within resolution while the parts share volume, and two ranges closer than that may be one; a range across a pose is one range. Empty for a refused pair.

Collider

class Collider

Parts meshed once, asked pose after pose which of them interfere: solids at rest, meshed at tolerance (0.05 by default); groups one group index per solid (std::nullopt: each solid its own group — Collider::check() then takes one frame per solid, and refuses a groups of any other length); allowed pairs of part indices never tested (designed contacts, by part index, flat: (a0, b0, a1, b1, ...)). Close it when done, or let the language's scope do it; see Lifetimes.

Collider::group_count()

std::uint32_t group_count() const

How many groups this collider has — the highest group index past the constructor, plus one.

Collider::stats()

Result<ColliderStats> stats() const

Counts of the last Collider::check() call, as a ColliderStats (all zero before the first one).

Collider::check()

Result<std::vector<CollisionHit>> check(const std::vector<std::reference_wrapper<const Frame>>& frames, const std::optional<std::pair<std::uint32_t, std::uint32_t>>& share = std::nullopt) const

The pairs that interfere, or could not be decided, with each group placed at its matching frame in frames (one Frame, or twelve numbers, per group, in group order), as CollisionHit values. share: std::nullopt, every pair past the box filters is decided now; (k, n), only those whose index is k modulo n — the shares of one pose are disjoint and cover it, so a caller splits one pose's work across n workers and puts the answers back together. Overlap is all check answers; the parts that touch or lie within a clearance of each other are Collider::clash()'s. frames not the collider's own Collider::group_count(), a frame that is not twelve finite numbers or not rigid, or a share with k >= n, returns an Error in its Result.

Collider::clash()

Result<std::vector<Clash>> clash(const std::vector<std::reference_wrapper<const Frame>>& frames, double clearance = 0.0, const std::optional<std::pair<std::uint32_t, std::uint32_t>>& share = std::nullopt) const

Every pair of parts that penetrates, touches or lies within clearance of the other, as Clash rows in pair order, with each group placed at its matching frame in frames (as Collider::check(), which answers overlap alone). The four kinds, their order of decision and the clearance are cadaclysm::blacksmith::clash()'s; the tolerance is the one the collider was built with. share as for check: the rows of the shares of one pose are disjoint and cover it. A pair's distance is measured on a closest mesh of each part, built at a third of the tolerance the first time a pair needs it and kept for the collider's lifetime, so a later pose pays only the measuring. clearance negative or not finite, the wrong number of frames, a frame that is not twelve finite numbers or not rigid, or a share with k >= n returns an Error in its Result. The motion between poses is Collider::swept_clash()'s question.

Collider::swept_clash()

Result<std::vector<SweptClash>> swept_clash(const Poses& poses, double clearance = 0.0, double resolution = 1e-3, std::uint32_t max_steps = 100000, const std::optional<std::pair<std::uint32_t, std::uint32_t>>& share = std::nullopt) const

Every pair of parts that penetrates, touches or comes within clearance of the other anywhere on the path through poses — not only at the poses — as SweptClash rows in pair order, each with the first time it does and the time ranges it stays in clash. poses is two or more poses, each the frames Collider::clash() takes (one per group); time runs in pose units, pose k at time k.

Between two poses each group moves rigidly about a pivot, the centre of its rest box: the pivot on the straight line between its two places, the rotation turning at a steady rate the shorter way round, so at each pose a group is exactly where that pose puts it. A part swinging about a far hinge cuts the chord between two poses: add poses where the true path matters.

The answer is not sampled. Each pair is stepped by conservative advancement: the gap is measured, and the next step is as long as the gap allows at the fastest the two parts can close on each other, so the guarantee is that no moment where the true gap is below clearance less the tolerance (for clearance 0: no penetration deeper than the tolerance) falls between two steps, and the first time is found to within the tolerance over that speed. While the parts share volume, how deep they are bounds how long they must stay so. resolution (in (0, 1], a fraction of a segment, 1e-3 by default) is how closely an interval's end is found; max_steps (100,000 by default) the tests one pair may take over the whole path — a pair that needs more, typically a thin part grazing another at speed, is a "refused" row whose first.text says so; raise it or add poses.

Pairs come from the swept boxes first: each part's box over a segment, both poses' boxes joined and grown by how far its rotation can carry a point off the chord. A pair whose swept boxes never come within the clearance is not stepped at all. share as for Collider::check(), over the pairs whose swept boxes meet: the shares of one call are disjoint and cover it. The pose caches Collider::check() and Collider::clash() keep are neither read nor filled (each time on the path is a new placement); the parts' meshes are made as those calls make them, and kept.

Fewer than two poses, a pose with the wrong number of frames, a frame that is not twelve finite numbers or not rigid, clearance negative or not finite, resolution outside (0, 1], max_steps 0, or a share with k >= n returns an Error in its Result.

Collider::close()

void close() noexcept

Free this handle now. The garbage collector, or the language's scope, does it otherwise.

ThicknessGauge

class ThicknessGauge

Wall thickness over solids, measured against each other: each solid meshed once at tolerance — absolute, in model units (0.01 by default) — and indexed, then asked reading after reading. A reading's body is the solid's index in solids. The gauge keeps its own reference to the bodies, so it answers on after they are closed. Close it when done, or let the language's scope do it; see Lifetimes. A tolerance not positive and finite returns an Error in its Result.

The rule reads the measuring mesh (ThicknessGauge::mesh()). From a point P the thickness is the distance to the nearest triangle that opposes P's own face (their normals more than 89 degrees apart) with P on or behind its plane — not a ray cast along the normal, so a box's corner reads the plate's thickness, not the diagonal. A triangle with a vertex exactly at P is skipped; where one of those meets P's own face at an interior angle under sharp_angle radians, P is a knife edge and reads 0. A point with no such triangle, or one further than maximum, gives no reading: readings are dropped, not clamped. Each reading then carries the opposite point refined onto its exact face (Thickness::exact_thickness), and the diameter of the largest ball tangent at P that holds none of the surfaces (Thickness::sphere). The two differ on a tilted wall: the rule reads the perpendicular foot, so a right wedge reads 3.54 at a point where the ball that fits there is 4.14 across; the ball is the wall's inscribed thickness.

ThicknessGauge::tolerance()

double tolerance() const

The tolerance the gauge meshed its bodies at.

ThicknessGauge::body_count()

std::uint32_t body_count() const

How many bodies the gauge measures: the length of solids it was built from.

ThicknessGauge::thickness()

Result<std::vector<Thickness>> thickness(double maximum, double sharp_angle = 0.0) const

One Thickness per measuring-mesh vertex that reads within maximum, by body then vertex; sharp_angle (radians, 0 by default) sets which vertices are knife edges. maximum not positive and finite, or sharp_angle negative or not finite, returns an Error in its Result.

ThicknessGauge::thickness_at()

Result<std::optional<Thickness>> thickness_at(std::uint32_t body, std::uint32_t face, const Vec3& point, double maximum, double sharp_angle = 0.0) const

The reading at point's foot on face face of body body, its vertex std::nullopt: the foot read against the exact tangent plane there, so a wall is measured between the mesh's vertices too. std::nullopt where the foot lies off the face, or the wall there is thicker than maximum. A body or a face past the end, a point not finite, or a bad maximum or sharp_angle returns an Error in its Result.

ThicknessGauge::thickness_at_face()

Result<std::optional<FaceThickness>> thickness_at_face(std::uint32_t body, std::uint32_t face, double maximum) const
Result<std::optional<FaceThickness>> thickness_at_face(std::uint32_t body, std::uint32_t face, const std::optional<Vec3>& at, double maximum) const

One figure for face face of body body, as a FaceThickness, the other bodies measured with it: at at's foot on the face, or with no at over the face's vertices. maximum has no default. std::nullopt where nothing on the face reads within maximum, or at's foot lies off the face. A body or a face past the end, an at not finite, or maximum not positive and finite returns an Error in its Result.

ThicknessGauge::mesh()

Result<ThicknessMesh> mesh(std::uint32_t body) const

Body body's measuring mesh, as a ThicknessMesh: the mesh a reading's vertex indexes, copied out, so it outlives the gauge. A body past the end returns an Error in its Result.

ThicknessGauge::close()

void close() noexcept

Free this handle now. Leaving a with block or the garbage collector does the same.

Thickness

struct Thickness

One wall-thickness reading on a solid, as plain data: what ThicknessGauge::thickness(), ThicknessGauge::thickness_at() and cadaclysm::blacksmith::thickness() return. Points are three numbers.

Thickness::body

std::uint32_t body

The body read: its index among the gauge's solids.

Thickness::vertex

std::optional<std::uint32_t> vertex

The vertex of that body's ThicknessGauge::mesh() the reading is at; std::nullopt for a reading at a point (ThicknessGauge::thickness_at()).

Thickness::face

std::uint32_t face

The face of body that point lies on.

Thickness::point

Vec3 point

Where the wall is read.

Thickness::thickness

double thickness

The rule's figure on the measuring mesh: the distance from point to opposite; 0 on a knife edge.

Thickness::opposite

Vec3 opposite

The nearest point on the opposing triangle; point itself on a knife edge.

Thickness::opposite_body

std::uint32_t opposite_body

The body opposite lies on: the gauge's bodies are measured against each other.

Thickness::opposite_face

std::uint32_t opposite_face

The face of opposite_body that opposite lies on.

Thickness::knife

bool knife

Whether point is a knife edge: thickness 0, opposite equal to point.

Thickness::exact_thickness

double exact_thickness

The distance from point to exact_opposite: the figure to compare with a closed form.

Thickness::exact_opposite

Vec3 exact_opposite

opposite moved onto its face's exact surface, where that foot lies within the tolerance of it and inside the face's trims; otherwise opposite itself.

Thickness::sphere

std::optional<double> sphere

The diameter of the largest ball tangent at point that holds none of the surfaces — the wall's inscribed thickness, which on a tilted wall is more than thickness; std::nullopt where no ball up to maximum is bounded, and 0 on a knife edge.

FaceThickness

struct FaceThickness

One face's wall thickness, as plain data: what ThicknessGauge::thickness_at_face() and Solid::thickness_at_face() return when something on the face reads. Over the face's vertices, thickness is the median of their exact readings, each vertex counting once (by vertex count, not by area); at a point, thickness, min and max are the one reading. The figure is meant for plate-like faces: by the rule a solid cylinder's side face (radius 5) reads about 7.07, 5√2, the chord to the first opposing facet past a quarter turn — not its diameter, and not uniform.

FaceThickness::thickness

double thickness

The median of the face's readings, or the reading at the point asked.

FaceThickness::min

double min

The thinnest reading on the face.

FaceThickness::max

double max

The thickest reading on the face.

FaceThickness::uniform

bool uniform

Whether max - min is within the gauge's tolerance; a very gentle taper reads as uniform.

ThicknessMesh

struct ThicknessMesh

A body's measuring mesh, copied out of the gauge: what ThicknessGauge::mesh() returns. Its vertices are split per face — no vertex is shared between two faces — so each carries its own face's exact normal.

ThicknessMesh::positions

std::vector<Vec3> positions

One point per vertex; a reading's vertex indexes them.

ThicknessMesh::normals

std::vector<Vec3> normals

One unit outward normal per vertex, its face's exact surface normal.

ThicknessMesh::triangles

std::vector<std::array<std::uint32_t, 3>> triangles

Three vertex indices per triangle.

ThicknessMesh::faces

std::vector<std::uint32_t> faces

The face of the body each triangle lies on.

MeshThickness

struct MeshThickness

One reading on a plain mesh, as plain data: what cadaclysm::blacksmith::mesh_thickness() returns. Points are three numbers.

MeshThickness::mesh

std::uint32_t mesh

The mesh read: its index among the meshes passed.

MeshThickness::vertex

std::uint32_t vertex

The vertex of that mesh the reading is at.

MeshThickness::thickness

double thickness

The distance from point to opposite; 0 on a knife edge.

MeshThickness::point

Vec3 point

The vertex's position.

MeshThickness::opposite

Vec3 opposite

The nearest point on the opposing triangle; point itself on a knife edge.

MeshThickness::opposite_mesh

std::uint32_t opposite_mesh

The mesh opposite lies on: the meshes are measured against each other.

MeshThickness::opposite_triangle

std::uint32_t opposite_triangle

The triangle of opposite_mesh that opposite lies on.

MeshThickness::knife

bool knife

Whether the vertex is a knife edge: thickness 0, opposite equal to point.

RTree

class RTree

A spatial index over boxes with ids (an R\*-tree): which entries a box meets, which are within a distance of a point or nearest it, which a ray passes through, and which pairs of boxes meet, between two trees or within one. RTree() is an empty tree; RTree::from_boxes(), RTree::from_points() and RTree::from_triangles() pack a whole set at once, and Solid::face_tree() gives one over a solid's faces. The tree changes in place (RTree::insert(), RTree::remove()) and stays balanced; its length is how many entries it holds.

An entry is an id and a box. Ids are the caller's own and may repeat: two entries may share an id, or an id and a box, and the same (id, box) twice is two entries, found twice. A box is (min, max) — two (x, y, z) triples — a Box, or 6 numbers [minx, miny, minz, maxx, maxy, maxz]; a point stands for a zero box. A box with a NaN or infinite coordinate, or min above max on an axis, is not a box. Touching boxes meet, everywhere: a box's faces count.

Answers come in a fixed order, so the same entries give the same answer whatever order they arrived in and however the tree was built: RTree::search() ids ascending, RTree::within() and RTree::nearest() by distance then id, pairs ascending. Distances are Euclidean from the point to the box, 0 inside it. slack is the largest gap between two boxes that still pair: two boxes at most slack apart on every axis pair, so 0 is touching. Calls on one tree must not overlap from two threads. Close it when done, or let the language's scope do it; see Lifetimes.

RTree::from_boxes()

static Result<RTree> from_boxes(const std::vector<std::pair<std::uint32_t, Box>>& entries)

A tree over (id, box) pairs at once, packed (sort-tile-recursive): fuller and faster to query than the same entries inserted one by one, and the same tree for any order of them. The first entry whose box is not a box returns an Error in its Result, by index.

RTree::from_points()

static Result<RTree> from_points(const std::vector<Vec3>& points)

A tree over points, each a zero box whose id is its index. The first point with a NaN or infinite coordinate returns an Error in its Result, by index.

RTree::from_triangles()

static Result<RTree> from_triangles(const std::vector<Vec3>& positions, const std::vector<std::array<std::uint32_t, 3>>& triangles)

A tree over a mesh's triangles in one call: triangles an (m, 3) sequence of indices into positions (an (n, 3) sequence of points), one entry per triangle, its id the triangle's index and its box its three corners' box. The first corner past the points (triangle 1 names point 9 of 4) or at a point with a NaN or infinite coordinate returns an Error in its Result, by triangle and point; points no triangle uses are not checked.

RTree::insert()

Result<void> insert(std::uint32_t id, const Box& box)
Result<void> insert(std::uint32_t id, const Vec3& point)

Add the entry (id, box), box a box or a point. A box that is not a box, or a point that is not finite, returns an Error in its Result and leaves the tree as it was.

RTree::remove()

Result<bool> remove(std::uint32_t id, const Box& box)
Result<bool> remove(std::uint32_t id, const Vec3& point)

Take out one entry equal to (id, box) and say whether there was one. remove needs the box the entry was inserted with, compared coordinate by coordinate (a point's is its zero box): the id alone does not find it. None found is False, not an error; with duplicates one goes per call. A box that is not a box returns an Error in its Result.

RTree::bounds()

Result<std::optional<Box>> bounds() const

The union of every entry's box as (min, max), or std::nullopt for an empty tree.

RTree::within()

Result<std::vector<RTreeHit>> within(const Vec3& point, double r) const

Every entry whose box is within r of point (0 inside the box; exactly r counts), as (id, distance) pairs by distance then id. A point not finite, or an r negative or NaN, returns an Error in its Result.

RTree::nearest()

Result<std::vector<RTreeHit>> nearest(const Vec3& point, std::uint32_t k) const

The k entries whose boxes are nearest point, as (id, distance) pairs by distance then id — the smaller ids win a tie at the k-th place; every entry when k is over the count, none for k 0 or an empty tree. A point not finite, or a k above 1,000,000, returns an Error in its Result.

RTree::ray()

Result<std::vector<RTreeHit>> ray(const Vec3& origin, const Vec3& direction, double max_t = std::numeric_limits<double>::infinity()) const

Every entry whose box the ray origin + t * direction, 0 <= t <= max_t, meets, as (id, t) pairs by t then id: t is where the ray enters the box, 0 when origin is inside it. Touching counts — a ray grazing a face or an edge, or running along one, meets the box. t is in units of direction's length, which is not normalised; max_t defaults to infinity. The boxes are what is tested: for a triangle or a face the caller tests the hits' own geometry. An origin or direction not finite, a zero direction, or a max_t negative or NaN returns an Error in its Result.

RTree::overlaps()

Result<std::vector<RTreePair>> overlaps(const RTree& other, double slack = 0.0) const

Every pair (a, b), a an entry of this tree and b one of other, whose boxes are at most slack apart on every axis (0 by default: touching), ascending. A slack negative or NaN returns an Error in its Result.

RTree::self_overlaps()

Result<std::vector<RTreePair>> self_overlaps(double slack = 0.0) const

Every unordered pair of distinct entries at most slack apart on every axis, once each as (smaller id, larger id), ascending — an id pairs with itself only where two entries share it. A slack negative or NaN returns an Error in its Result.

RTree::close()

void close() noexcept

Free this handle now. Leaving a with block or the garbage collector does the same.

Interpolator

class Interpolator

A list of samples read at a fractional index, as Rhino's Interpolator: animation keys, a value along a pattern, a smoothed profile of measurements. Interpolator(samples, cyclic) takes numbers, or equal-length sequences of numbers — 2D or 3D points, or vectors of any dimension; samples of unequal lengths are refused before the call. Its length is how many samples it holds.

t is a fractional sample index: t = 2 is sample 2, t = 2.5 halfway between samples 2 and 3. An open list clamps t to [0, length - 1] and stops on its first and last samples, an end sample standing in for its missing neighbour; a cyclic list wraps t with period length (t = length is sample 0, t = -0.5 halfway between the last sample and the first).

The five modes are Paul Bourke's formulas, in the notation mu the fraction past sample i and y0 ... y3 the samples at i - 1 ... i + 2; every mode returns the sample itself at a whole t. A dimension-1 interpolator answers numbers, others tuples, each component read on its own (every mode is a fixed linear combination of at most four samples). A sample that is NaN or infinite, no samples at all, or a t that is NaN or infinite returns an Error in its Result; a mode name not among the five is refused before the call. It never changes once made. Close it when done, or let the language's scope do it; see Lifetimes.

Interpolator::dimension()

std::uint32_t dimension() const

How many numbers a sample holds: 1 answers numbers, more answers tuples.

Interpolator::cyclic()

bool cyclic() const

Whether t wraps round the list (true) or is clamped to its ends (false).

Interpolator::at()

Result<std::vector<double>> at(double t, InterpolatorMode mode = InterpolatorMode::linear) const

The value at the fractional index t by mode — "nearest", "linear" (the default), "cosine", "cubic" or "catmull_rom". A t that is NaN or infinite returns an Error in its Result.

Answers a std::vector<double> of dimension numbers, whatever the dimension, and sample a std::vector of them; mode is an InterpolatorMode (InterpolatorMode::linear by default).

Interpolator::sample()

Result<std::vector<std::vector<double>>> sample(const std::vector<double>& ts, InterpolatorMode mode = InterpolatorMode::linear) const

The values at every t of ts by mode, as Interpolator::at() reads each, in one call. A value of t that is NaN or infinite (by its index), or more than 1,000,000 of them, returns an Error in its Result.

Interpolator::nearest()

Result<std::vector<double>> nearest(double t) const

The sample at floor(t + 1/2) — a half rounds up — after the clamp or wrap.

Interpolator::linear()

Result<std::vector<double>> linear(double t) const

Straight between the samples either side of t: y1 + (y2 - y1) mu.

Interpolator::cosine()

Result<std::vector<double>> cosine(double t) const

Linear at (1 - cos(pi mu)) / 2 instead of mu: an ease, flat at every sample.

Interpolator::cubic()

Result<std::vector<double>> cubic(double t) const

Bourke's cubic over the four samples about t: a0 mu^3 + a1 mu^2 + a2 mu + y1 with a0 = y3 - y2 - y0 + y1, a1 = y0 - y1 - a0, a2 = y2 - y0. Through every sample, but not C1, and it does not reproduce a straight ramp.

Interpolator::catmull_rom()

Result<std::vector<double>> catmull_rom(double t) const

The Catmull-Rom spline over the four samples about t: through every sample, C1, its tangent at each (y2 - y0) / 2. It reproduces straight ramps and parabolas sampled at whole t.

Interpolator::close()

void close() noexcept

Free this handle now. Leaving a with block or the garbage collector does the same.

Animation

class Animation

Keyframe tracks over named targets: what moves, turns, scales, shows, tints or ghosts, and when. A host plays it by asking, at a time t in seconds, for each target's Animation::placement_at() (a 4x4 matrix) and each track's Animation::value_at(). Animation() makes an empty one; tracks are added with Animation::add_track() or one of the channel helpers.

A track drives one channel of one target — any non-empty name: a part, a node, a light — through keys, (time, value) pairs with times in seconds, strictly increasing. There are seven channels, each with its own kind of key value. A "translate" key carries an offset (x, y, z). A "rotate" key carries an angle in degrees about the track's axis through its pivot (right-handed; see Animation::set_pivot()). A "scale" key carries factors (sx, sy, sz) about the track's pivot. A "visible" key carries a number, shown when above 0.5, and a "ghost" key one, ghosted when above 0.5; both always hold, as "nearest". A "colour" key carries (r, g, b). A "value" key carries any number, or a list of numbers of any length — a dial, a gauge, a host's own signal.

The mode reads between keys, as the Interpolator's five: "nearest" holds the latest key at or before t (a key at 2 takes effect at 2), "linear" (the default), "cosine" (linear on a cosine ease), "cubic" (Bourke's cubic on the four keys about t at the segment's fraction — the sampled-curve form; prefer Catmull-Rom for uneven keys) and "catmull_rom" (the non-uniform Hermite: C1, its tangents in value per second; evenly spaced keys equal the interpolator's). Before the first key a track reads its first value, after the last its last; one key is a constant. A track's duration is its last key time, and the animation's is the latest over all its tracks (0 with none).

A target's placement is its scales, then its rotates, then its translates, applied in that order, composed T_n ... T_1 * R_m ... R_1 * S_k ... S_1 (the first added of each kind applied first), a rotate as Tr(p) * Rot(axis, angle) * Tr(-p) and a scale as Tr(p) * diag(s) * Tr(-p) about its pivot p. A target with no placement track answers the identity. Targets are numbered in order of first appearance. The View plays an animation in a later release.

A track the kernel refuses — an empty target, no keys, a time that is negative, NaN or not increasing, a value that is NaN or infinite, a dimension the channel does not take, a value track of dimension 0, more than 1,000,000 keys — returns an Error in its Result and leaves the animation unchanged. A channel or mode name not among those above, or keys whose values differ in length, returns an Error in its Result before the call, and leaves it unchanged too. Close it when done, or let the language's scope do it; see Lifetimes.

Animation::add_track()

Result<std::size_t> add_track(const std::string& target, AnimationChannel channel, const std::vector<AnimationKey>& keys, InterpolatorMode mode = InterpolatorMode::linear)

Add a track driving channel of target through keys by mode ("linear" by default) and return its index, counting from 0 in the order added. A value that is a number is dimension 1; the values of one track all have the same length. A refusal returns an Error in its Result, with the call's name in front (animation_add_track: times must increase: key 2 at 1 after 1.5).

Keys are a std::vector<AnimationKey>, an AnimationKey being a time and a std::vector<double> value ({0.0, 5.0} for dimension 1, {1.0, {1.0, 2.0, 3.0}} for three); channel is an AnimationChannel (translate ... value, the C codes 0..6), mode an InterpolatorMode (InterpolatorMode::linear by default). Returns Result<std::size_t>, the track index.

Animation::translate()

Result<std::size_t> translate(const std::string& target, const std::vector<AnimationKey>& keys, InterpolatorMode mode = InterpolatorMode::linear)

A translate track: keys (time, (x, y, z)), an offset in model units.

Keys are AnimationKeys: {time, {x, y, z}}.

Animation::rotate()

Result<std::size_t> rotate(const std::string& target, const std::vector<AnimationKey>& keys, const Vec3& pivot = {0.0, 0.0, 0.0}, const Vec3& axis = {0.0, 0.0, 1.0}, InterpolatorMode mode = InterpolatorMode::linear)

A rotate track: keys (time, degrees), about axis (+Z by default, any non-zero vector, taken as a direction) through pivot (the origin by default), right-handed. A pivot or axis that is not three numbers returns an Error in its Result; one with an entry that is NaN or infinite, or an axis too short to point anywhere, returns an Error in its Result. Either adds no track.

Keys are {time, degrees}; pivot and axis are Vec3s (std::array<double, 3>), so a wrong count does not compile; the defaults are the origin and +Z.

Animation::scale()

Result<std::size_t> scale(const std::string& target, const std::vector<AnimationKey>& keys, const Vec3& pivot = {0.0, 0.0, 0.0}, InterpolatorMode mode = InterpolatorMode::linear)

A scale track: keys (time, (sx, sy, sz)), about pivot (the origin by default). A pivot that is not three numbers returns an Error in its Result; one with an entry that is NaN or infinite returns an Error in its Result. Either adds no track.

Keys are {time, {sx, sy, sz}}; pivot is a Vec3, so a wrong count does not compile.

Animation::visible()

Result<std::size_t> visible(const std::string& target, const std::vector<AnimationKey>& keys)

A visibility track: keys (time, number), shown when above 0.5. Always read as "nearest".

Keys are {time, number}.

Animation::colour()

Result<std::size_t> colour(const std::string& target, const std::vector<AnimationKey>& keys, InterpolatorMode mode = InterpolatorMode::linear)

A colour track: keys (time, (r, g, b)).

Keys are {time, {r, g, b}}.

Animation::ghost()

Result<std::size_t> ghost(const std::string& target, const std::vector<AnimationKey>& keys)

A ghost track — a part shown faded, as a host draws one: keys (time, number), ghosted when above 0.5. Always read as "nearest".

Keys are {time, number}.

Animation::value()

Result<std::size_t> value(const std::string& target, const std::vector<AnimationKey>& keys, InterpolatorMode mode = InterpolatorMode::linear)

A free value track: keys (time, number) or (time, numbers) of any length, the same for every key.

Keys are {time, number} (dimension 1) or {time, {numbers...}} of any length.

Animation::set_pivot()

Result<void> set_pivot(std::size_t track, const Vec3& pivot, const Vec3& axis = {0.0, 0.0, 1.0})

Set the pivot and axis (three numbers each; the axis +Z unless given) of the rotate or scale track track. A pivot or axis that is not three numbers returns an Error in its Result. Any other kind of track, an entry that is NaN or infinite, or a rotate axis too short to point anywhere, returns an Error in its Result.

set_pivot(std::size_t track, const Vec3& pivot, const Vec3& axis = {0, 0, 1}) returns Result<void>: Vec3s, so a wrong count does not compile.

Animation::duration()

Result<double> duration() const

The latest key time over all tracks, in seconds; 0 with no tracks.

duration() returns Result<double>.

Animation::targets()

Result<std::vector<std::string>> targets() const

The target names, in order of first appearance. The index of a name is the index Animation::placement_at() takes.

targets() returns a Result<std::vector<std::string>>; the track count is size() (a bad access, not an Error, on a closed animation, as Interpolator::size is).

Animation::track()

Result<AnimationTrack> track(std::size_t i) const

Track i, as it was added, as an AnimationTrack: its target, channel and mode names (the mode as asked, though visible and ghost evaluate as "nearest"), the key times, the key values (dimension numbers a key), the dimension, and the pivot and axis (the origin and +Z unless set). An i that is not below the track count returns an Error in its Result.

An AnimationTrack struct: times a std::vector<double>, values a std::vector<std::vector<double>> with one row of dimension numbers a key, mode an InterpolatorMode, channel an AnimationChannel, pivot and axis Vec3s. operator== compares by value.

Animation::value_at()

Result<std::vector<double>> value_at(std::size_t track, double t) const

The value of track track at time t, by its mode: dimension numbers. A t that is NaN or infinite, or a track out of range, returns an Error in its Result.

value_at(std::size_t track, double t) returns a Result<std::vector<double>> of dimension numbers, a vector of one at dimension 1.

Animation::values_at()

Result<std::vector<std::vector<double>>> values_at(double t) const

The value of every track at time t, in track order, each shaped as Animation::value_at()'s; an empty list with no tracks. A t that is NaN or infinite returns an Error in its Result.

values_at(double t) returns a Result<std::vector<std::vector<double>>>, one std::vector<double> a track.

Animation::placement_at()

Result<std::array<double, 16>> placement_at(std::size_t target, double t) const
Result<std::array<double, 16>> placement_at(const std::string& target, double t) const

The placement of target — its name, or its index in Animation::targets() — at time t, as a 4x4 matrix in the View's set_placement layout: four columns of four numbers, m[col][row], the translation in the fourth column. A name that is not a target returns an Error in its Result; an index out of range, or a t that is NaN or infinite, returns an Error in its Result.

Answers 16 numbers as a std::array<double, 16>, column-major (m[col * 4 + row]). placement_at(const std::string&, double) for a name, placement_at(std::size_t, double) for an index; an unknown name returns an Error.

Animation::clone()

Result<Animation> clone() const

An independent copy: tracks added to either never reach the other.

Animation::close()

void close() noexcept

Free this handle now. A second call does nothing; any other call after it returns an Error in its Result. Leaving the scope that owns it does the same.

A second call does nothing; any other call after it returns an Error ("animation: closed"). The destructor does the same.

AnimationTrack

struct AnimationTrack

One track of an Animation, read back as it was given by Animation::track(): a plain record, equal to another by value, that holds no handle and needs no closing.

AnimationTrack::target

std::string target

The name of the target it drives.

AnimationTrack::channel

AnimationChannel channel

The channel's name: "translate", "rotate", "scale", "visible", "colour", "ghost" or "value".

An AnimationChannel enum value, not a string.

AnimationTrack::mode

InterpolatorMode mode

The mode's name, as it was asked. A visible or ghost track reads as "nearest" whatever it says.

An InterpolatorMode enum value, not a string.

AnimationTrack::times

std::vector<double> times

The key times, in seconds, increasing.

AnimationTrack::values

std::vector<std::vector<double>> values

The key values: numbers at dimension 1, dimension numbers a key.

AnimationTrack::dimension

std::uint32_t dimension

How many numbers a key's value holds.

AnimationTrack::pivot

Vec3 pivot

The pivot a rotate or scale works about: the origin unless set. Any track has one.

AnimationTrack::axis

Vec3 axis

The axis a rotate turns about: +Z unless set. Any track has one.

Document

class Document

A model as data: a graph of nodes (profile.rect, solid.extrude, measure.mass, ...), each a blacksmith verb reading other nodes by id, with named parameters that any number can be an "=expression" of, evaluated incrementally, and edited by ops that are undoable and branch. The whole thing — nodes, parameters, history, branches — saves as JSON text (the cadaclysm-blacksmith format, version 1) and loads back to the same document.

A node has a kind, which names the verb and its inputs, and fields: a number, an "=expression" over the parameters and other nodes' values, or the id of another node to read. An expression holds numbers with units (3 mm, 45 deg), lists ([1, 2, 3 mm], range(0, 360, 60), item, slice, merge, flatten, reverse, len, polar, zip), comparisons, and, or, not and if(c, a, b); arithmetic maps over lists item by item, the shorter padded with its last item. A node given a list where a field takes one number runs once per item and gives the list of its results ("lacing": "cross" takes every combination); a value node holds one expression for others to read by its id ("=v1"). Every edit is an op — add, set, remove, rename or param — and one op is one commit. A refused op returns an Error in its Result with the reason, and the document is unchanged.

The nodes are brought up to date when you read one: only the nodes an edit made stale are evaluated again, and a node that fails is reported by errors while the nodes that do not read it still answer. A node's result comes out as the language's own type: a Solid, a Profile, a NurbsCurve, a Subd, or a plain value.

The web build's history. The kernel wasm module carries the same document, and also a JavaScript-only history binding, cadaclysm_blacksmith_history_*, over the same commits and branches for a page that shows a timeline. It is not part of this page's wrapper surface: for now the Python members below are the history surface.

Close it when done, or let the language's scope do it; see Lifetimes. One thread at a time.

Document::load()

static Result<Document> load(const std::string& text)

The document that save wrote as text: its nodes, parameters, history and branches.

Document::load(text) answers a Result<Document>; Document::make(units) (default "mm") makes an empty one.

Document::open()

static Result<Document> open(const std::string& path)

The document saved in the file at a path.

Takes the path as a std::string.

Document::kinds()

static Result<std::string> kinds()

Every node kind the library knows, one record a kind: its name, inputs, output, cost and help. Needs no document.

The JSON text of the rows.

Document::new_bim()

static Result<Document> new_bim(const std::string& units = "mm")

An empty building document: the blacksmith kinds and the bim.* ones (levels, layered walls and their joins, doors, windows, floors), holding a bim.project node whose random guid seeds every IFC GlobalId it exports.

Document::new_bim(units), default "mm".

Document::load_bim()

static Result<Document> load_bim(const std::string& text)

A building document that save wrote as text, opened with the bim.* kinds.

Document::open_bim()

static Result<Document> open_bim(const std::string& path)

The building document saved in the file at a path.

Takes the path as a std::string.

Document::bim_kinds()

static Result<std::string> bim_kinds()

Every node kind a building document knows, the blacksmith's and the bim.* ones, as kinds lists them. Needs no document.

The JSON text of the rows.

Document.parts_catalog

Loads the parts catalogue (a directory of family files and their index) that parts.catalog nodes build their parts from: servos, bars, brackets, bearings, pulleys. Replaces the one loaded before.

Not in C++ yet.

Document.new_parts

An empty bench document, in millimetres: the blacksmith kinds, the assembly.* ones among them, and parts.catalog, a catalogue part by its entry and parameters.

Not in C++ yet.

Document.load_parts

A bench document that save wrote as text (the robot bench's file), opened with the parts.* kinds. A file that is not a document returns an Error in its Result saying so.

Not in C++ yet.

Document.open_parts

The bench document saved in the file at a path.

Not in C++ yet.

Document.parts_kinds

Every node kind a bench document knows, the blacksmith's and the parts.* ones, as kinds lists them. Needs no document.

Not in C++ yet.

Document::export_ifc()

Result<std::string> export_ifc(const std::optional<std::string>& options_json = std::nullopt)

The building as IFC text, IFC4 or IFC2x3, its geometry parametric (the design intent: extruded outlines, openings voiding their walls) or exact (the evaluated bodies, openings already cut); with a path, also written to that file. The time stamp defaults to now. A document that cannot be written in full returns an Error in its Result with every reason at once, one a line, each on its node, and nothing is written.

export_ifc(options_json) takes the C ABI's options as JSON text ({"schema": "IFC2X3", "geometry": "exact", "timestamp": 0, "name": "..."}, every key optional; std::nullopt, the default, is every default) and answers the text: write it to a file yourself. A refusal is an Error with the library's text verbatim, bim_document_export_ifc: {"refusals": [{"node": id | null, "reason": text}]}.

Document.sheet_svg

A sheet (a bim.sheet node, by id) as SVG text sized in paper millimetres — its frame, title block, and the plans, sections, elevations, schedules and 3D views placed on it (a 3D view is drawn as its visible lines; a picture-style one, which only the web editor renders, as a box reading "3D view not rendered") — evaluating the document first; with a path, also written to that file. A node that is not a sheet returns an Error in its Result.

Not in this wrapper yet: Python and the C API have it.

Document.sheet_pdf

A sheet (a bim.sheet node, by id) as a one-page PDF the size of its paper, with a bookmark naming it — its frame, title block, and the plans, sections, elevations, schedules and 3D views placed on it (a 3D view is drawn as its visible lines; a picture-style one, which only the web editor renders, as a box reading "3D view not rendered") — evaluating the document first; with a path, also written to that file. A node that is not a sheet returns an Error in its Result.

Not in this wrapper yet: Python and the C API have it.

Document.sheets_pdf

Several sheets (ids) as one PDF: a page each in the order given, each its paper's size, a bookmark a page, a 3D view drawn as its visible lines (a picture-style one, which only the web editor renders, as a box reading "3D view not rendered"); with a path, also written to that file. An empty list, or a node that is not a sheet, returns an Error in its Result.

Not in this wrapper yet: Python and the C API have it.

Document::save()

Result<std::string> save() const

The document as JSON text; with a path, also written to that file.

Answers the text; write it to a file yourself.

Document::apply()

Result<std::string> apply(const std::string& op, const std::optional<std::string>& message = std::nullopt)

Applies one op, given as a JSON record or its text ({"op": "add", "node": {...}}, set, remove, rename, param), and records it as one commit with an optional message. Answers the changed set: the ids added, changed and removed, and the parameter names touched.

Takes the op as JSON text and an optional message; answers the changed set as JSON text.

Document.add

A new node of a kind with its fields, one commit. Its id is made up unless the call gives one; the id is returned.

Not in C++: send the add op as JSON text with apply.

Document::add_solid()

Result<std::string> add_solid(const Solid& solid, bool sheet = false)

A node holding a solid the caller already has — made in code or read from a file — for other nodes to read like any built one: a solid.body node (a sheet.body one for a sheet) carrying the kernel's own B-rep (Solid::document_body()), in the document's units, inside the saved file, which gives back exactly that body. Edges and faces are referenced on it as on any node, and replacing its body later finds them again by geometry. Its colours are kept — the solid's, each face's and each edge's — its name is not. The new id is returned.

add_solid(solid, sheet): sheet true makes a sheet.body node; the default a solid.body.

Document::add_profile()

Result<std::string> add_profile(const Profile& profile)

A profile.path node holding a Profile exactly (Profile::document_path(): arcs and NURBS as they are, holes included, its colour kept), in the document's units. The new id is returned.

Document.set

Sets fields of a node, one commit; answers the changed set.

Not in C++: send the set op as JSON text with apply.

Document.remove

Removes a node. Refused while another node reads it, unless cascade takes those readers with it.

Not in C++: send the remove op as JSON text with apply.

Document.rename

Gives a node a display name; none clears it.

Not in C++: send the rename op as JSON text with apply.

Document::params()

Result<std::string> params() const

The parameters, name to value (a number, or an "=expression"), as a mutable mapping. Assigning one is a param op, one commit; deleting one removes it.

Answers the JSON text of the parameters; read-only: set one with a param op through apply.

Document::batch()

detail::ScopeResult<F> batch(const std::optional<std::string>& message, F&& body)
detail::ScopeResult<F> batch(F&& body)

Ops applied live inside the block are recorded as one commit with the block's message. An error inside rolls every op of the batch back and is passed on.

batch(message, body) (or batch(body)) runs body, a callable returning void or a Result, inside the batch: a normal return ends it and the body's Result comes back; an Error returned, or an exception thrown, aborts it and is passed on, a refused clean-up swallowed.

Document::preview()

detail::ScopeResult<F> preview(F&& body)
Result<std::string> preview_frame(const std::string& op)
Result<std::string> end_preview()

Ops applied inside the block evaluate but are never recorded, and are taken back on leaving, normally or by an error: a drag, a what-if.

preview(body) runs a callable inside the preview, as batch does. The editor's drag is preview_frame(op), one frame (each takes the last back first; the changed set as JSON text), and end_preview(), which takes the drag back.

Document::undo()

Result<bool> undo()

Takes back the head commit. False when there was nothing to take back.

A Result<bool>.

Document::redo()

Result<bool> redo()

Puts back the commit undo took back. False when there was nothing to put back.

A Result<bool>.

Document.can_undo

Whether undo has a commit to take back.

Not in C++: read branch, head, can_undo and can_redo from the JSON text branches() answers.

Document.can_redo

Whether redo has a commit to put back.

Not in C++: read branch, head, can_undo and can_redo from the JSON text branches() answers.

Document.branch

The current branch's name, or none when the head is detached (switched to a commit id).

Not in C++: read branch, head, can_undo and can_redo from the JSON text branches() answers.

Document::branches()

Result<std::string> branches() const

Every branch, name to the id of its tip commit.

Answers the branch list as JSON text, {"branches": {name: commit}, "branch": name | null, "head": commit, "unnamed": [commit], "can_undo": bool, "can_redo": bool}.

Document::branch_new()

Result<void> branch_new(const std::string& name, const std::optional<std::string>& at = std::nullopt)

A new branch. Without a commit id it starts at the head and the document switches onto it; with one it starts there.

Document::switch_to()

Result<void> switch_to(const std::string& name_or_commit_id)

Moves the head to the branch of that name, else to the commit of that id, which detaches the head. The nodes follow.

switch_to: switch is a C++ keyword.

Document::branch_rename()

Result<void> branch_rename(const std::string& old, const std::string& renamed)

Renames a branch; refused when the old name is missing or the new one is taken.

Document::branch_delete()

Result<void> branch_delete(const std::string& name)

Deletes a branch; the current branch is refused. Its commits stay, as tips.

Document::tips()

Result<std::string> tips() const

The tips of the lines no branch names — what an undo followed by an edit leaves behind — each as a whole Commit.

Answers the commits as JSON text.

Document::log()

Result<std::string> log(const std::optional<std::string>& branch = std::nullopt) const

The commits of a branch's line, newest first, the root c0 last; with no branch, the line from the head back to the root.

Answers the commits as JSON text; log() is the line from the head.

Document.head

The commit the document is at.

Not in C++: read branch, head, can_undo and can_redo from the JSON text branches() answers.

Document::evaluate()

Result<std::string> evaluate(bool cheap_only = false)

Evaluates the nodes that are stale (only the cheap kinds when asked) and answers the status of every node: ok, error, blocked or pending.

Answers the JSON text of the statuses; evaluate() evaluates every stale node.

Document::evaluate_with()

Result<std::string> evaluate_with(const DocumentProgress& progress, bool cheap_only = false)

evaluate, with every kernel call's progress heard by a callback as (node, phase, done, total): node the id of the node being built, phase a short name, done of total steps within it. Every heavy node reports start before it runs, so a progress bar knows what is building and a host that crashes knows which node to leave out next time. The statuses are the same as evaluate's; a cheap-only pass reports nothing. The callback runs on the calling thread, often, and must not touch the document.

evaluate_with(progress, cheap_only) with a DocumentProgress answers the JSON text of the statuses; an empty function is silent.

Document::errors()

Result<std::string> errors()

The nodes the evaluation left in error or blocked, each with its message.

Answers the JSON text of the rows.

Document::value()

Result<std::string> value(const std::string& id)

A node's value: a number, a point or list, a record, or text. returns an Error in its Result for a node with none (missing, or in error).

Answers the value's JSON text.

Document::result_kind()

Result<std::string> result_kind(const std::string& id)
Result<Solid> result_solid(const std::string& id)
Result<Profile> result_profile(const std::string& id)
Result<std::vector<Profile>> result_profiles(const std::string& id)
Result<NurbsCurve> result_nurbs_curve(const std::string& id)
Result<Subd> result_subd(const std::string& id)

What a node evaluated to, by its kind: a Solid (solids and sheets), a Profile, a list of profiles, a NurbsCurve, a Subd, a list of these for a node run over a list (each item also read as id#i), or the value of a number, point, record, list and the like; none for no such node or one that failed. Each handle is the caller's own and outlives later edits.

Typed reads instead of one: result_kind names what the node gave ("solid", "profiles", "nurbs", "none", ...), then result_solid (solids and sheets), result_profile, result_profiles, result_nurbs_curve or result_subd reads it as an ordinary Solid, Profile, std::vector<Profile>, NurbsCurve or Subd, and value anything else. A missing node, one that failed or one of another kind is an Error.

Document.result_garment

Node id's value as a Garment: a garment.garment node, or any node that evaluates to one. Its lengths are in the document's units (convert a non-millimetre garment to millimetres before Garment.to_aama). A missing node, one that failed or one of another kind returns an Error in its Result.

Not in this wrapper yet.

Document::revision()

Result<std::uint64_t> revision() const

A counter that moves once with every change to the document's state — an apply, an undo or redo, a branch made, switched to or deleted, a preview frame, a batch's end — and never with an evaluation, a save or a read. A new or loaded document starts at 1. A page keys what it read on it and asks again only when it moved.

Document.clear_history

Starts the history again from the document as it is: one root commit holding it, so an undo has nothing to take back and a redo nothing to put back; every branch but main is gone. The nodes and results are untouched. An app calls it after New or Open, so its first undo never empties the document. Refused while a batch, a preview or a probe is open.

Not in this wrapper yet.

Document::nodes()

Result<std::string> nodes(const std::vector<std::string>& ids = {}) const

The nodes as the file holds them, all of them in document order or those a list of ids names, in that order; an open batch's or preview's edits are in it. An unknown id returns an Error in its Result, naming it.

Document::inputs()

Result<std::string> inputs(const std::string& id, bool transitive = false) const

The ids of the nodes a node reads, in document order: those its fields name, or with transitive everything those read too, however far, each once. Parameters are walked through, not listed. An unknown id returns an Error in its Result.

Document::readers()

Result<std::string> readers(const std::string& id, bool transitive = false) const

The mirror of Document::inputs(): the ids of the nodes that read a node, directly or with transitive however far — what removing it would break.

Document::probe()

detail::ProbeResult<F> probe(const std::string& op, const std::vector<std::string>& ids, F&& body)

An op tried on a scratch copy: only the nodes ids names and what they read are evaluated, and their statuses answered. Until the probe ends, those nodes' results are the probe's and every other node's the document's; the document's nodes, history and revision are untouched, and every call that would change it is refused. A snapping tool tries a placement this way. Refused while a batch, a preview or another probe is open, for an op the copy refuses, or for an unknown id.

probe(op, ids, body) runs body(statuses); a guard ends the probe on every exit.

Document::result_beziers()

Result<std::vector<double>> result_beziers(const std::string& id, const std::optional<FrameLike>& frame = std::nullopt)

A curve node, a profile, a list of profiles or a sketch as rational cubic Béziers, sixteen numbers each — x y z w per control point, as Profile::beziers() gives them: a curve on its own frame, a profile on the sketch plane, or either carried onto frame. An open probe's value is read for a node it evaluated. A node with none — a solid, a value — returns an Error in its Result.

Document::meta()

Result<std::optional<std::string>> meta(const std::string& app) const

An app's own data about the document — what the last meta op set for it: a camera, a grid, a selection — undone and saved with the rest, never read by evaluation. None when the app keeps none.

Document::close()

void close() noexcept

Free this handle now. Leaving a with block or the garbage collector does the same.

The destructor does the same; every call after is an Error, document: closed.

Commit

One commit of a Document's history, as plain data: what Document::log(), Document::tips() and Document.head return.

Not in C++: log and tips answer the commits as JSON text.

Commit.id

The commit's id; c0 is the root.

Not in C++: log and tips answer the commits as JSON text.

Commit.parents

The ids of the commits it follows.

Not in C++: log and tips answer the commits as JSON text.

Commit.message

The message it was recorded with; none when not set.

Not in C++: log and tips answer the commits as JSON text.

Commit.author

Who recorded it; none when not set.

Not in C++: log and tips answer the commits as JSON text.

Commit.time

When it was recorded; none when not set.

Not in C++: log and tips answer the commits as JSON text.

Commit.ops

The ops it applied, each as the record that was sent.

Not in C++: log and tips answer the commits as JSON text.

SubdMesh

struct SubdMesh

One level of a cage's smooth surface, as Subd::smooth_mesh() returns it: positions and normals (limit positions and unit outward limit normals, three numbers a vertex), indices (three vertex ids a triangle) and triangle_face (the face of the full cage each triangle lies on; on a mirrored half, face f of the half is f and its reflection f + len(faces)). Copied out of the cage, so it outlives it; the arrays are writable. At the C ABI the same arrays are views into the cage's handle, good until that handle is freed.

SubdMesh::positions

std::vector<Vec3> positions

The limit positions, an (n, 3) float64 array.

A std::vector<Vec3> (Vec3 is std::array<double, 3>), a field.

SubdMesh::normals

std::vector<Vec3> normals

The unit outward limit normals, an (n, 3) float64 array matching positions.

A std::vector<Vec3>, a field.

SubdMesh::indices

std::vector<std::uint32_t> indices

The triangles, an (m, 3) uint32 array of ids into positions.

A flat std::vector<std::uint32_t>, three ids a triangle, a field.

SubdMesh::triangle_face

std::vector<std::uint32_t> triangle_face

The cage face each triangle lies on, an (m,) uint32 array: the full cage's numbering (see above for a mirrored half).

A std::vector<std::uint32_t>, a field.

SubdReport

struct SubdReport

What Subd::to_solid() did and how close it came, as plain data: how many patches were built exactly from their own net (regular) and how many from a refined neighbourhood (refined), the Catmull-Clark steps taken first, the deepest local refinement a patch needed (levels), and the two figures the options bound — the largest deviation from the limit surface and the largest tangent break g1_angle_deg across a side that is not creased — with the world points they were measured at.

SubdReport::regular

std::uint32_t regular

Patches built exactly from their own net, with no refinement.

SubdReport::refined

std::uint32_t refined

Patches built from a refined neighbourhood.

SubdReport::steps

std::uint32_t steps

The Catmull-Clark steps taken before the patches were cut: 1 or 2.

SubdReport::levels

std::uint32_t levels

The deepest local refinement a patch took; 0 when none was refined.

SubdReport::deviation

double deviation

The largest deviation from the limit surface, as a fraction of the cage's bounding-box diagonal.

SubdReport::g1_angle_deg

double g1_angle_deg

The largest tangent break across a side that is not creased, in degrees.

SubdReport::deviation_at

Vec3 deviation_at

The world point deviation was measured at, three numbers.

A Vec3 (std::array<double, 3>), a field.

SubdReport::g1_at

Vec3 g1_at

The world point g1_angle_deg was measured at, three numbers.

A Vec3 (std::array<double, 3>), a field.

Subd

class Subd

A Catmull-Clark control cage: positions, faces, creased edges, pinned vertices, an optional mirror plane, and the selection of the edit that made it. It is immutable — every edit returns a new Subd, whose selection names what that edit touched — and Subd::to_solid() turns it into an exact B-rep that every Solid call takes. Close it when done, or let the language's scope do it; see Lifetimes. A refusal returns an Error in its Result with the kernel's own words.

What the conversion to a solid does and does not do: it cuts one NURBS face per quad after one Catmull-Clark step, or two when a quad of the first step has two extraordinary corners (every cylinder primitive; SubdReport.steps says which) — so a cage quad gives 4 faces after one step, an n-gon n, and the 6-sided plain cylinder gives 144 — with a tangent-continuous block at each extraordinary vertex. A smooth vertex of high valence (7 or more on these primitives) may be refused at the default tolerances, with the measured figures: a plain 7-sided cylinder is, while an 8-sided one with creased rims converts. A crease or boundary side with 4 or more faces on one side has no tangent plane there, so a conversion through one may be refused. Fillets along edges that are splines are not available yet. At the C ABI, the arrays Subd::positions() and Subd::smooth_mesh() give are views into the cage's handle, good until that handle is freed.

Subd::close()

void close() noexcept

Free this handle now. The garbage collector, or the language's scope, does it otherwise.

Subd::cuboid()

static Result<Subd> cuboid(const std::array<double, 3>& size = {2.0, 2.0, 2.0}, const std::array<std::uint32_t, 3>& segments = {1, 1, 1})

A box of size (x, y, z), centred on the origin, with segments quads along each axis (1 to 1024 each). Default: a 2 x 2 x 2 box of one quad a side.

size is a std::array<double, 3> and segments a std::array<std::uint32_t, 3>, both defaulted ({2, 2, 2} and {1, 1, 1}). Returns a Result<Subd>.

Subd::cylinder()

static Result<Subd> cylinder(double radius = 1.0, double height = 2.0, std::uint32_t sides = 8, std::uint32_t rings = 1, bool creased_rims = true)

A cylinder along +Z: one n-gon cap per end with sides sides and rings bands of quads between them. With creased_rims (the default in Python) the two rim loops are creased, so the caps stay flat; an uncreased cylinder of 7 or more sides is refused by Subd::to_solid() at the default tolerances.

All five arguments are defaulted (creased_rims true): Subd::cylinder(). Returns a Result<Subd>.

Subd::sphere()

static Result<Subd> sphere(double radius = 1.0, std::uint32_t segments = 2)

A quad ball of radius: a cube grid with segments quads per edge (at most 1024), each vertex pushed out to the radius.

Both arguments are defaulted: Subd::sphere(); segments is a std::uint32_t. Returns a Result<Subd>.

Subd::torus()

static Result<Subd> torus(double major = 3.0, double minor = 1.0, std::uint32_t around = 12, std::uint32_t tube = 8)

A torus around +Z, all quads: around steps about the axis at radius major, tube steps round the tube of radius minor.

All four arguments are defaulted: Subd::torus(); around and tube are std::uint32_ts. Returns a Result<Subd>.

Subd::from_parts()

static Result<Subd> from_parts(const std::vector<Vec3>& positions, const std::vector<std::vector<std::uint32_t>>& faces, const std::vector<SubdEdge>& creases = {}, const std::vector<std::uint32_t>& pins = {}, const std::optional<SubdSymmetry>& symmetry = std::nullopt)

A cage from its parts, the lossless inverse of reading them back: positions (n, 3), faces lists of vertex ids, creases (a, b) pairs that are edges, pins vertex ids, and symmetry std::nullopt or an axis ("x", "y" or "z") with a tolerance, for a mirrored half, as Subd::symmetry() reports it. The new cage selects nothing. A malformed cage returns an Error in its Result.

positions is a std::vector<Vec3> (Vec3 is std::array<double, 3>); faces a std::vector<std::vector<std::uint32_t>>; creases a std::vector<SubdEdge> (struct SubdEdge { std::uint32_t a, b; }); pins a std::vector<std::uint32_t>; symmetry a std::optional<SubdSymmetry> (axis, tolerance), SubdAxis being x, y or z. The last three are defaulted to none. Returns a Result<Subd>.

Subd::positions()

std::vector<Vec3> positions() const

The cage's vertices, an (n, 3) float64 array of your own: a copy.

A std::vector<Vec3>, a copy; a method.

Subd::faces()

std::vector<std::vector<std::uint32_t>> faces() const

Each face's vertex ids, in loop order.

A std::vector<std::vector<std::uint32_t>>, a copy; a method.

Subd::creases()

std::vector<SubdEdge> creases() const

The creased edges, each as (smaller id, larger id), sorted.

A std::vector<SubdEdge>, a copy; a method.

Subd::pins()

std::vector<std::uint32_t> pins() const

The pinned vertices: they refine as corners and stay put.

A std::vector<std::uint32_t>, a copy; a method.

Subd::symmetry()

std::optional<SubdSymmetry> symmetry() const

std::nullopt for an ordinary cage; for a mirrored half, the plane's axis ("x", "y" or "z") and how far from it a vertex counts as on it.

A std::optional<SubdSymmetry> (axis, tolerance), std::nullopt for none; a method.

Subd::selection()

std::optional<SubdSelection> selection() const

What the edit that made this cage touched: "vertices" or "faces" with ids, or "edges" with (a, b) pairs; std::nullopt for a cage no edit selected (a primitive, Subd::from_parts(), the mirror calls).

A std::optional<SubdSelection>, std::nullopt for none; a method. SubdSelection is kind (SubdElements::vertices, edges or faces), ids for vertices and faces and edges (std::vector<SubdEdge>) for edges, the other empty; built with SubdSelection::of_vertices, of_edges and of_faces.

Subd::transform()

Result<Subd> transform(const SubdSelection& selection, const std::vector<double>& matrix) const

A new cage with the selected elements moved by matrix, and the same elements selected. selection is "vertices", "edges" or "faces" with ids (edges as (a, b) pairs); matrix is sixteen numbers column-major. A rotation about a point is baked into the matrix by the caller.

selection is a SubdSelection; matrix a std::vector<double> of 16, column-major (any other length is refused, naming the matrix). Returns a Result<Subd>.

Subd::crease()

Result<Subd> crease(const std::vector<SubdEdge>& edges, bool on = true) const

A new cage with edges ((a, b) pairs) creased, or un-creased when on is false; it selects them. A pair that is not an edge returns an Error in its Result.

edges is a std::vector<SubdEdge>; on defaults to true. Returns a Result<Subd>.

Subd::pin()

Result<Subd> pin(const std::vector<std::uint32_t>& vertices, bool on = true) const

A new cage with vertices pinned (they refine as corners and stay put), or released when on is false; it selects them.

vertices is a std::vector<std::uint32_t>; on defaults to true. Returns a Result<Subd>.

Subd::extrude()

Result<Subd> extrude(const std::vector<std::uint32_t>& faces, double distance) const

A new cage with faces pushed out by distance along each connected region's average normal, with a quad wall on each boundary edge. The moved faces keep their ids and the new cage selects them.

faces is a std::vector<std::uint32_t>. Returns a Result<Subd>.

Subd::inset()

Result<Subd> inset(const std::vector<std::uint32_t>& faces, double amount, bool individual = false) const

A new cage with faces shrunk by amount, in (0, 1), within their surface, and a ring of quads round each region (round each face, with individual). The new cage selects the inner faces.

faces is a std::vector<std::uint32_t>; individual defaults to false. Returns a Result<Subd>.

Subd::subdivide()

Result<Subd> subdivide(const std::vector<std::uint32_t>& faces = {}) const

A new cage with faces subdivided once by the Catmull-Clark rules (the whole cage when no faces are given): each face becomes quads round a new point, and an unpicked face beside them takes the new edge points as corners. The whole cage keeps its smooth surface exactly. The new cage selects the new faces.

faces is a std::vector<std::uint32_t>, empty by default. Returns a Result<Subd>.

Subd::insert_loop()

Result<Subd> insert_loop(const SubdEdge& edge, double at = 0.5) const

A new cage with a loop of edges cut across the ring of quads through edge (an (a, b) pair), at a + at * (b - a) with at in (0, 1). It selects the new loop.

edge is a SubdEdge; at defaults to 0.5. Returns a Result<Subd>.

Subd::edge_loop()

Result<std::vector<SubdEdge>> edge_loop(const SubdEdge& edge) const

The loop of edges through edge, straight across each valence-four vertex, the picked edge first and each pair smaller id first; empty when edge is not an edge of the cage.

Takes a SubdEdge and returns a Result<std::vector<SubdEdge>>, empty for no loop.

Subd::mirror_on()

Result<Subd> mirror_on(SubdAxis axis) const

The positive half of the cage across the plane perpendicular to axis ("x", "y" or "z"), as a mirrored cage: every later edit keeps it symmetric.

axis is a SubdAxis: SubdAxis::x, y or z. Returns a Result<Subd>.

Subd::mirror_off()

Result<Subd> mirror_off() const

The mirror baked: the whole cage as an ordinary one, no longer mirrored.

Subd::full()

Result<Subd> full() const

The whole cage of a mirrored half — the half's vertices first, then the reflections of those off the plane — or a copy of an ordinary cage.

Subd::smooth_mesh()

Result<SubdMesh> smooth_mesh(std::uint32_t levels = 3) const

The smooth surface refined levels times (1 to 6, 3 by default), as a SubdMesh.

levels is a std::uint32_t, 3 by default. Returns a Result<SubdMesh>.

Subd::pick()

Result<std::optional<SubdSelection>> pick(const Vec3& point, SubdElements kind) const

The cage element of kind ("vertex", "edge" or "face") under point, a point on or near the smooth surface: a vertex or face id, or an edge as (a, b) with the smaller id first. std::nullopt when nothing is within 0.05 of the cage's diagonal — not an error. A point that is not finite returns an Error in its Result, which is not the same answer as nothing near.

point is a Vec3; kind a SubdElements (vertices, edges or faces). Returns a Result<std::optional<SubdSelection>> holding one element (an edge in edges), std::nullopt for nothing near.

Subd::to_solid()

Result<SubdSolid> to_solid(double tolerance = 1e-4, double g1_angle = 0.1, std::uint32_t max_levels = 6) const

The cage as an exact Solid, one NURBS face per patch (see above), and a SubdReport of what the conversion did. tolerance is the largest deviation from the limit surface as a fraction of the cage's diagonal (1e-4 by default), g1_angle the largest tangent break across an uncreased side in degrees (0.1), max_levels the deepest local refinement (2 to 6, 6). A tolerance or g1_angle of 0 or less, or a max_levels of 0, takes the default; any other max_levels outside 2 to 6 returns an Error in its Result. A cage that cannot be held within them returns an Error in its Result, with the figures it measured.

Returns a Result<SubdSolid>, struct SubdSolid { Solid solid; SubdReport report; }; tolerance, g1_angle and max_levels (a std::uint32_t) default to 1e-4, 0.1 and 6.

Hit

struct Hit

One place two curves meet, as plain data, copied out: what Profile::hits() lists. A point has run false and start equal to end; a run has the two curves coinciding from start to end. A point at the join of two segments is reported once, on either: as segment k at t 1 or as segment k + 1 at t 0.

Hit::run

bool run

Whether the curves coincide along a stretch rather than meeting at a point.

Hit::touch

bool touch

For a point: the curves are tangent there rather than crossing. Where a side ends there, true if the two continue each other smoothly; an end resting on the other at an angle, or a corner, is not a touch.

Hit::start

Vec3 start

Where it starts, three numbers (z is 0 for two profiles).

Hit::end

Vec3 end

Where it ends: start again for a point.

Hit::a_start

Spot a_start

Where it starts on the first curve, as a Spot.

Hit::a_end

Spot a_end

Where it ends on the first curve.

Hit::b_start

Spot b_start

Where it starts on the second curve.

Hit::b_end

Spot b_end

Where it ends on the second curve.

Spot

struct Spot

Where a Hit lands on one side: a profile's loop, segment and position along it, or (from later calls) a solid's face and its surface parameters.

Spot::loop_index

std::uint32_t loop_index

The loop: 0 the boundary or the open chain, then the holes in the order they were added. NONE on a face.

Spot::segment

std::uint32_t segment

The segment of that loop, in drawing order. NONE on a face.

Spot::t

double t

How far along the segment, 0 at its start to 1 at its end: by length on a line, by angle on an arc, by parameter on a spline.

Spot::face

std::uint32_t face

The face, on a solid; NONE on a profile.

Spot::u

double u

The face's first surface parameter; 0 on a profile.

Spot::v

double v

The face's second surface parameter; 0 on a profile.

SolidHits

struct SolidHits

What Solid::hits() found, copied out: hits, every place profile pierces or grazes this solid's faces, as Hit values (a the profile, b the face: face, u, v), ordered along the profile; pieces, the profile's loops cut at the hits, as Piece values — empty unless the solid is closed.

SolidHits::hits

std::vector<Hit> hits

Every place profile meets a face, as Hit values.

SolidHits::pieces

std::vector<Piece> pieces

The profile's loops cut at the hits, as Piece values; empty for an open solid.

Piece

struct Piece

One stretch of Solid::hits()'s profile between two cuts, as plain data: one of SolidHits::pieces. A piece's spots follow the cut, not the hit that made it: a segment join reads as the next segment's start (k + 1, 0), not the hit's (k, 1), and a closed loop's closing join stays (0, 0); an open chain's end reads (n - 1, 1). A loop no hit cuts is one piece, geometrically closed, start and end both (0, 0).

Piece::inside

bool inside

Whether the piece is inside the solid, by its middle's winding number over the solid's mesh — a piece lying on the surface (a run, or a midpoint within tolerance of a face and inside it) counts as inside too, with no third state.

Piece::start

Spot start

Where the piece starts, as a Spot.

Piece::end

Spot end

Where the piece ends, as a Spot.

Piece::profile

Profile profile

The piece on its own, as an open Profile — unless the piece is a whole uncut loop, which comes back closed.

Manifold

using Manifold = cadaclysm::Manifold

What Solid::manifold() returns: whether the solid's faces make a manifold, and whether it is closed, told from its topology rather than a mesh.

blacksmith::Manifold is cadaclysm::Manifold: Solid::manifold returns the reader's struct.

Manifold.faces

How many faces.

blacksmith::Manifold is cadaclysm::Manifold: Solid::manifold returns the reader's struct.

Manifold.edges

How many distinct edges: one shared by two faces counts once.

blacksmith::Manifold is cadaclysm::Manifold: Solid::manifold returns the reader's struct.

Manifold.vertices

How many distinct vertices.

blacksmith::Manifold is cadaclysm::Manifold: Solid::manifold returns the reader's struct.

Manifold.boundary_edges

Edges only one face borders: a sheet's rim, a hole in a shell.

blacksmith::Manifold is cadaclysm::Manifold: Solid::manifold returns the reader's struct.

Manifold.non_manifold_edges

Edges three or more faces border: a fin, or two solids meeting along a line.

blacksmith::Manifold is cadaclysm::Manifold: Solid::manifold returns the reader's struct.

Manifold.non_manifold_vertices

Vertices whose faces make more than one fan: two solids touching at a corner.

blacksmith::Manifold is cadaclysm::Manifold: Solid::manifold returns the reader's struct.

Manifold.is_manifold

No non-manifold edge or vertex: a manifold, possibly with a boundary.

blacksmith::Manifold is cadaclysm::Manifold: Solid::manifold returns the reader's struct.

Manifold.is_closed

A manifold with no boundary edge either: it encloses a solid.

blacksmith::Manifold is cadaclysm::Manifold: Solid::manifold returns the reader's struct.

FemMesh

class FemMesh

One solid meshed for a solver: nodes welded by bits, triangles wound outward, every node tagged with the lowest-dimension B-rep entity it lies on, and every crack reported rather than closed. What Solid::fem_mesh() returns, and owned by you: free it, or let the language's scope do it (see Lifetimes).

A handle rather than a snapshot, as a Solid is. In every wrapper that can lend a view, the big arrays are read-only views into the library's own memory, as Solid::mesh()'s are — a solver mesh is megabytes. Node and Godot copy instead, having no borrowed-view machinery at all, so for those two the array is theirs and everything below about a stale view falls away. Either way the owner of the memory is this object rather than the solid: Solid::close() does not free a FEM mesh, and meshing the solid again at another tolerance does not touch it either — a FEM mesh and a held tessellation (Solid::mesh()'s own) are each their own handle, neither one the solid's cache that a re-mesh replaces. Only FemMesh::free() does, or the language's own scope or collector reclaiming the handle.

So keep the FEM mesh itself reachable for as long as you read a view of it, and copy anything that must outlive it. What refuses a stale read is a different mechanism in each language, so all ten are named here rather than a rule with an "otherwise" in it. Swift's view type carries its owner and asks it before every element, so the read itself is refused — it traps inside the subscript getter, measured in a release build. Rust settles it before the program runs: its free takes the mesh by value, so a slice can neither be asked for after it nor held across it. Godot and Node hand back copies, so there is nothing of the library's left to go stale. Python, C#, Java and C++ check the handle in the accessor, so a view asked for after the free is refused and one already in hand is a bare array, span or buffer that reads freed memory — measured in C#, where a span taken before the free read the body's own coordinates out of the freed block. Python's numpy array does hold the mesh, which keeps it reachable (below), but nothing asks the mesh when the array is read, so one kept past an explicit free() dangles as C#'s span does. Go's and LuaJIT's arrays are fields filled when the mesh was built rather than accessors, so neither moment is refused there; their methods are, and for those two this is documented rather than enforced, as their own module headers already do for the scene.

Staying reachable is a second question, and a narrower one. In C#, Java, Go and LuaJIT the view is the platform's own array type with nowhere to hold a reference back to the handle, so a program that keeps a view and lets go of the mesh can have the collector free the handle under it with nothing ever calling FemMesh::free() — measured in C#, Java and Go. C++ has no collector but the same shape at scope end: the mesh's destructor frees the handle when it goes out of scope, and a Span kept past that reads freed memory. A view type that carries its owner is safe from that (Python's, Swift's), and so is a language that rules the case out — Rust borrows the mesh for the view's lifetime, Godot and Node copy. The same rule as Solid::mesh()'s own views.

It is freed where a Solid is closed: the same word the reader library's FEM mesh uses, so one FEM mesh is released the same way on both sides of the ABI.

FemMesh::nodes()

Span<const double> nodes() const

Every node's position, three doubles each: placed by Solid::fem_mesh()'s placement, in the solid's own coordinates otherwise.

The five arrays are Spans into the handle's own memory, and every accessor here checks the handle in both modes — not only under CADACLYSM_CHECKED, as the scene's and the solid's views do, because what it guards is a pointer handed to C, the way Meshlets' own check does, rather than a borrowed view's owner. So a call on a freed mesh — an array, a count, or either .msh call — goes to CADACLYSM_BAD_ACCESS rather than returning an Error, even in a release build. A Span already in hand is a pointer and a length from then on, and reading one after free() — or after the FemMesh itself went out of scope — reads freed memory in either mode: measured on a body away from the origin, it still gave that body's own coordinates until the block was reused. So hold the FemMesh while you read a span, and copy (std::vector<double>(mesh.nodes().begin(), mesh.nodes().end())) anything that must outlive it. FemEdge's nodes and runs borrow the same way.

FemMesh::triangles()

Span<const std::uint32_t> triangles() const

Three node indices a triangle, wound outward — a mirroring placement is wound back.

FemMesh::triangle_face()

Span<const std::uint32_t> triangle_face() const

Which face each triangle lies on, one per triangle: the same faces Solid::face_kind() names.

FemMesh::node_kind()

Span<const std::uint32_t> node_kind() const

What each node lies on — 0 a B-rep vertex, 1 an edge, 2 a face — one per node: the lowest-dimension entity it lies on, which is the .msh format's own classification rule. FemMesh::node_entity() says which entity of that kind.

FemMesh::node_entity()

Span<const std::uint32_t> node_entity() const

Which vertex, edge or face each node lies on, read by the matching FemMesh::node_kind(): an index into FemMesh::vertices(), into FemMesh::edges(), or into the solid's faces.

FemMesh::face_count()

std::uint32_t face_count() const

The solid's faces — the same faces Solid::faces() counts.

FemMesh::edges()

Result<std::vector<FemEdge>> edges() const

One FemEdge per B-rep edge, in the order a FemMesh::node_kind() of 1 indexes them. Not Solid::edges()' numbering: these are the manifold analysis's, ascending by edge id.

FemEdge

struct FemEdge
std::uint32_t id
Span<const std::uint32_t> nodes
Span<const std::uint32_t> runs
std::pair<std::uint32_t, std::uint32_t> faces
std::pair<std::uint32_t, std::uint32_t> ends
bool closed
bool seam
std::vector<Span<const std::uint32_t>> chains() const

One B-rep edge's chain of nodes, and where that chain breaks. nodes are this mesh's node indices in order along the edge, its end vertices included. runs says where the chain breaks: each entry is a start offset into nodes, and the nodes from one offset up to the next — the last offset running to the end — are a polyline of their own, with nothing joining across a boundary. The two ends either side of a boundary are two points of the edge with no mesh edge between them. (0,) is the ordinary answer, and a caller reading nodes as one polyline without looking here jumps the gap silently.

faces is (face_a, face_b) and ends is (end_a, end_b), the second of each a sentinel where there is none — an open sheet's rim, or both ends at one vertex. 0 is a real face and a real vertex, not a sentinel, and faces numbers the solid's faces as Solid::face_kind() does. closed where the nodes make one loop, never with more than one run; seam where one face bounds the edge twice, and both faces are then that same face.

id is the solid's own edge id, not this mesh's edge index: FemMesh::edges() is a densely renumbered subset of the solid's edges, with every edge collapsed to a point left out, so a sphere — whose two pole runs collapse — reports its seam as edge 0 with an id of 1. Everything else that names an edge means the index: a FemMesh::node_kind() of 1 read through FemMesh::node_entity(), the third number of a FemMesh::open_edges() or FemMesh::folded_edges() row, and the edge_<i> physical group of FemMesh::msh_text(). It is not a row of Solid::edges() either, that table being the solid's edges grouped by geometry; the id names the topological edge, which is what the .msh entities and the censuses speak in.

FemMesh::vertices()

Result<std::vector<FemVertex>> vertices() const

One FemVertex per B-rep vertex, in the order a FemMesh::node_kind() of 0 indexes them.

FemVertex

struct FemVertex
std::uint32_t node
Vec3 point
bool has_position

One B-rep vertex: node is the mesh node there, a sentinel where the mesh has none, which is ordinary rather than a fault — the analysis rebuilds a vertex wherever two trims meet, so a sphere has 48 of them where the mesh has two points, and a caller walking these skips the sentinel instead of reading it as a gap.

point is where the topology says the vertex is, in the same space and under the same placement as FemMesh::nodes(). Meaningless unless has_position: it is all zeros then, a point no geometry has and one a solver would read as a node at the origin.

FemMesh::open_edges()

Result<std::vector<std::array<std::uint32_t, 3>>> open_edges() const

Every crack, as (a, b, brep_edge): a directed mesh edge (a, b) with no (b, a), and the B-rep edge both nodes lie on where they share one.

Empty unless the solid's topology is closed, whose mesh is otherwise not asked about at all: an open sheet from Solid::face(), Solid::face_sheet(), Solid::drop_faces() or Solid::extrude_open() makes no claim to enclose anything, so its rim is not a crack. Such a solid reports FemMesh::watertight() false with this and FemMesh::folded_edges() both empty, and that trio of answers together is what says "not asked", not "nothing found".

That rule holds here without exception, where the reader library has one: every solid has a B-rep behind it, so this library has no mesh-only body whose census speaks from the triangles alone. See FemMesh::from_mesh().

FemMesh::folded_edges()

Result<std::vector<std::array<std::uint32_t, 3>>> folded_edges() const

Every fold, as FemMesh::open_edges() reports a crack: a directed mesh edge used by more than one triangle, once.

A solid can be folded without being open — one no thicker than a line leaves no hole for an open edge to find — and the closure census's own known-bad bodies are folds rather than open cracks. A caller that checks FemMesh::open_edges() alone calls such a solid sound. Empty under the same rule as FemMesh::open_edges().

FemMesh::crossings()

Result<std::vector<std::array<std::uint32_t, 2>>> crossings() const

Every pair of triangles that pass through each other, as (a, b) with a < b, sorted: an edge of one through the other's interior. Their B-rep faces are FemMesh::triangle_face() at a and b.

Computed for every solid, open or closed. FemMesh::watertight(), FemMesh::open_edges() and FemMesh::folded_edges() are topological and cannot see a surface passing through itself; a mesh is ready for a volume mesher when it is FemMesh::watertight() and this is empty — Gmsh refuses one that crosses. A copy.

FemMesh::watertight()

bool watertight() const

The topology is closed and the welded mesh is too — every directed mesh edge paired with its reverse and none used twice. false for every solid whose topology is not closed; read FemMesh::open_edges() for what an empty census beside a false here does and does not mean.

Ready for a volume mesher means this and an empty FemMesh::crossings(): this census is topological and cannot see a surface passing through itself.

FemMesh::from_mesh()

bool from_mesh() const

Always false here, and kept so the two ABIs hand back one struct: a Solid always has a B-rep, so this library has no mesh-only body to report.

The reader's Node::fem_mesh() sets it for a node with no B-rep, where it also says which space the mesh is in — here there is only one space, the solid's own under the placement — and where a true means the crack census spoke from the triangles alone rather than from a topology. That second difference cannot arise on this side.

FemMesh::min_angle()

double min_angle() const

The smallest interior angle of any triangle, in degrees. There is always one: a solid that meshed to no triangles is a refusal, not a mesh.

FemMesh::worst_triangle()

std::uint32_t worst_triangle() const

The triangle with that angle, as an index into FemMesh::triangles().

FemMesh::longest_edge()

double longest_edge() const

The longest triangle edge, placed. The figure to check against Solid::fem_mesh()'s max_size, and the only one that says what the mesh actually is. max_size bounds the boundary segments and merely targets the interior: measured at 1.03 x max_size on a face whose parameters run unevenly, where a full-size boundary piece met a much shorter one left by halving. One small enough beside the solid to reach the mesher's own piece and station ceilings is not honoured at all.

FemMesh::msh_text()

Result<std::string> msh_text() const

The mesh as Gmsh 4.1 ASCII .msh text: an entity per B-rep vertex, edge and face, a volume where the solid closes, and a physical group naming each.

Gmsh reads the file as written — measured with Gmsh 4.15: node and triangle counts equal to this mesh's, and a physical group per entity. To fill a closed solid with tetrahedra, give Gmsh a volume of its own over the file's surfaces. In its Python API: gmsh.open(path), then faces = [t for _, t in gmsh.model.getBoundary([(3, 1)], oriented=False)], gmsh.model.geo.addVolume([gmsh.model.geo.addSurfaceLoop(faces)]), gmsh.model.geo.synchronize() and gmsh.model.mesh.generate(3). A plain generate(3) leaves a volume read from any .msh file empty — Gmsh's own saved meshes too — and gmsh.model.mesh.createGeometry() re-meshes the surfaces rather than keeping these triangles.

Prefer Gmsh's HXT algorithm: gmsh.option.setNumber("Mesh.Algorithm3D", 10) before generate(3). On these surfaces the default left tetrahedra of exactly zero volume (four in a 100 mm bar), which no solver can use, and HXT's worst element came out far better on curved bodies (a minimum SICN of 0.1 to 0.3 where the default's was 0.001). Then name the tetrahedra before saving: HXT fills the new volume rather than the file's own, and gmsh.write keeps only elements in a physical group, so without this step every tetrahedron is dropped from the file without a word — filled = [t for _, t in gmsh.model.getEntities(3) if len(gmsh.model.mesh.getElementsByType(4, t)[0])], gmsh.model.removePhysicalGroups(gmsh.model.getPhysicalGroups(3)) and gmsh.model.addPhysicalGroup(3, filled, name="body"). The saved file also lists a few interior nodes no element uses — points Gmsh's refinement tried and gave up on — so a solver reading it should keep only the tetrahedra's own nodes: each unused one is an unconstrained unknown.

On this side of the ABI the library's text is owned and handed over, released by the wrapper (cadaclysm_blacksmith_string_free at the ABI) as every other text this library writes — Solid::step_text(), Solid::sat_text(), Solid::brep_text(). Two asks give two independent texts, and neither dies with the handle. The reader library's own msh_text is the other way round: it borrows a slot on its handle, replaced by the next call and gone with the mesh. A reader porting one side's reasoning onto the other leaks or double-frees.

The unlicensed notice is printed here, on this writer and on FemMesh::save_msh(), and not by Solid::fem_mesh(): meshing is not a licensed output and the .msh file is, which is where Solid::sat_text() and Solid::brep_text() put theirs too. The reader library notices in its constructor instead and on neither .msh call; each matches its own siblings, so moving the call to look like the other side breaks a convention.

It returns an Error in its Result for a mesh the writer refuses, naming the field it cannot honour, and for a freed handle.

A freed handle traps here rather than returning an Error. This call, save_msh and every array accessor check the handle first, and on a freed one that check reaches CADACLYSM_BAD_ACCESS (blacksmith::FemMesh::msh_text: the FEM mesh is freed) and does not return — in both modes, not only under CADACLYSM_CHECKED, because what it guards is a pointer about to be handed to C rather than a borrowed view's owner. Measured. So the Result above carries the writer's refusal and nothing else; a freed handle is a bug in the caller, as it is for Meshlets.

FemMesh::save_msh()

Result<void> save_msh(const std::string& path) const

FemMesh::msh_text() written to a path, replacing any file there. It returns an Error in its Result for a mesh the writer refuses or a file it cannot write, naming the path. Prints the unlicensed notice; see FemMesh::msh_text().

FemMesh::free()

void free() noexcept

Give the mesh back, and with it every view taken from it. Idempotent; the collector or the scope does it otherwise.

FemMesh::freed()

bool freed() const noexcept

Whether the mesh has been freed.

Tool

class Tool

A cutter: Grbl tool number (1 to 255, the T word), diameter and flute_length in mm, feed and plunge in mm/min, rpm its spindle speed, ramping into its cuts at ramp_angle degrees. Immutable; a job keeps its own copy.

Tool::flat()

static Result<Tool> flat(std::uint32_t number, double diameter, double flute_length, double feed, double plunge, double rpm, double ramp_angle = 3.0)

A flat end mill. A number outside 1..255, a size, feed or speed not positive and finite, or a ramp_angle outside (0, 90], returns an Error in its Result.

Tool::ball()

static Result<Tool> ball(std::uint32_t number, double diameter, double flute_length, double feed, double plunge, double rpm, double ramp_angle = 3.0)

A ball end mill, as flat but its tip a half sphere of the diameter; in 2.5D it cuts where a flat does, bottom being the tip.

Tool::drill()

static Result<Tool> drill(std::uint32_t number, double diameter, double flute_length, double feed, double rpm)

A drill, plunging at feed. A job takes it for Job::drill() only.

Tool.number

The Grbl tool number, 1 to 255 (the T word).

Not in this wrapper yet.

Tool.shape

The cutting end: "flat", "ball", "drill", "vbit" or "bullnose" — spelled as a machining view's tool description spells it.

Not in this wrapper yet.

Tool.diameter

The cutting diameter, in mm.

Not in this wrapper yet.

Tool.flute_length

How far up the cutting edge reaches from the tip, in mm.

Not in this wrapper yet.

Tool.angle

A V-bit's included angle, in degrees; std::nullopt for every other shape.

Not in this wrapper yet.

Tool.corner_radius

A bull-nose's corner radius, in mm; std::nullopt for every other shape.

Not in this wrapper yet.

Tool::with_ramp_angle C++ only

Result<Tool> with_ramp_angle(double degrees) const

A new tool: this one, ramping into its cuts at degrees from the horizontal instead. Python sets the ramp when the tool is made (Tool::flat()'s and Tool::ball()'s ramp_angle), and those two call this themselves for an angle other than the library's own 3.0; it is public so a tool already in hand can be re-ramped without repeating its other arguments. Fails for an angle outside (0, 90].

Stock

class Stock

The block of material a job cuts, an axis-aligned box. Immutable; a job keeps its own copy.

Stock::box()

static Result<Stock> box(const Vec3& min, const Vec3& max)

The box from min (x, y, z) to max. Unless every min is below its max and all six are finite, returns an Error in its Result.

Stock::around()

static Result<Stock> around(const Solid& solid, double margin = 0.0)

solid's bounds grown by margin in -X, +X, -Y, +Y and +Z; the bottom stays at the solid's lowest Z. A margin negative or not finite returns an Error in its Result.

Program

struct Program

One file a job wrote: a Grbl program (tool its T number, name <job name>-T<n>, or <job name>-<k>-T<n> for a repeated tool) or, from Job::write_camotics(), a simulation copy or the CAMotics project (tool 0). Read-only.

Program::tool

std::uint32_t tool

The program's Grbl T number, or 0 for a CAMotics project file.

Program::name

std::string name

The program's name without extension (<name>-T<n>, or <name>-<k>-T<n> for a repeated tool) from Job::gcode(); the file name from Job::write_camotics().

Program::text

std::string text

The program's text.

Job

class Job

A machining job on a Stock: operations kept in the order they are added, written as one Grbl 1.1 program per run of operations sharing a tool. Mutable — each operation is added in place, and a refused one leaves the job as it was. safe_z is the absolute Z of rapids between operations and at a program's start and end, above the stock's top; an operation enters and leaves its passes clearance above its top; tolerance fits free-form sides and offsets; name names the programs (<name>-T<n>); every program waits spindle_dwell seconds after starting the spindle; resolution is the CAMotics project's voxel size in mm. A safe_z not above the stock, or a setting the job refuses, returns an Error in its Result.

Job::face()

Result<void> face(const Tool& tool, double z, double stepover, double stepdown)

Face the stock's top down to z, in zigzag rows along X stepover apart and passes at most stepdown deep. A drill, a z above the stock's top, a stepover past the tool's diameter, or what the job otherwise refuses, returns an Error in its Result.

Job::contour()

Result<void> contour(const Tool& tool, const Profile& profile, double top, double bottom, const std::string& side = "outside", double stepdown = 1.0, bool climb = true, bool open = false)

Cut along profile from top to bottom in passes at most stepdown deep: side "outside" the profile, "inside" it, or "on" its line; climb for climb milling, else conventional; open to cut the outline as an open chain (only "on" its line, and with no holes). Any other side raises ValueError; what the job otherwise refuses, returns an Error in its Result.

Job::pocket()

Result<void> pocket(const Tool& tool, const Profile& profile, double top, double bottom, double stepover, double stepdown)

Clear profile — its holes left standing as islands — from top to bottom, in rings stepover apart (at most the tool's radius) and passes at most stepdown deep. What the job refuses returns an Error in its Result; a pocket too small for the tool is refused by Job::gcode(), naming the operation.

Job::drill()

Result<void> drill(const Tool& tool, const std::vector<Vec2>& points, double top, double bottom, std::optional<double> peck = std::nullopt)

Drill a hole at each (x, y) of points from top to bottom, pecking peck deep at a time (retracting between pecks), or straight to depth for none. A point that is not two numbers raises ValueError; a tool that is not a drill, no points, or what the job otherwise refuses, returns an Error in its Result.

Job::gcode()

Result<std::vector<Program>> gcode() const

The job as Grbl 1.1 programs, one per run of consecutive operations sharing a tool (T1, T2, T1 gives three), each named <name>-T<n> (or <name>-<k>-T<n> for run k of a tool that runs more than once); an empty list for a job with no operations. An operation whose geometry the tool cannot cut (named by its index and kind) returns an Error in its Result.

Job::write_camotics()

Result<std::vector<std::string>> write_camotics(const std::string& path) const

A CAMotics project at path and its files beside it, named after the project's file stem (out/part.camotics writes out/part-T1.nc), not the job's name: each program, a simulation copy of it (.sim.nc, which the project lists), and the project last. Creates the directory. Returns the paths written, the project last. A path with no file stem, what Job::gcode() refuses, or a file that cannot be written, returns an Error in its Result.

Job::machine()

Result<Report> machine(const Solid& part, const Tool& end_mill, const std::vector<const Tool*>& drills = {}, std::optional<double> stepover = std::nullopt, std::optional<double> stepdown = std::nullopt, double skin = 0.3, std::optional<double> peck = std::nullopt)

Recognise part — a solid inside the job's stock — by Z-level sectioning, and append the operations that make it: one face (if the stock top is above the part's top), the pockets level by level from the top down, then one drill per drill tool and bottom. end_mill must be a flat or ball tool, not a drill; drills are tried against each hole found, the closest match within 0.05 mm winning. end_mill may also be a list of end mills, largest first: the first clears as above, and each later one cleans only what the earlier ones left — inside corners, regions too narrow for them, and holes no drill matches — with pockets of its own after the earlier tools' and before the drills. Each later tool's stepover and stepdown default to its own; one given applies to the first and is clamped to each later tool's radius and flutes. The report then lists only what no end mill reached; a corner, or a region too narrow, names the smallest end mill that tried. stepover defaults to 0.4 x diameter, stepdown to min(diameter / 2, flute_length) (std::nullopt asks for the kernel's own default for either); skin (at least 0, default 0.3) is how far above the part's lowest point the outline stops, so the part stays attached to the stock — 0 cuts through; corner_relief (default off) relieves every inside corner the smallest end mill leaves with a dog-bone: the cutter runs on along the corner's bisector until its edge touches the corner, notching both walls by r (1 - sin(θ/2)) for a corner of angle θ — 0.293 mm for a 2 mm end mill at a right angle. Each comes back as a relief item in place of its corner item: the vertex, the notch depth as size, the tool and Z range in reason, the notch as its region. Narrow regions, undercuts, holes and slopes are never relieved. peck is passed to every drill operation (std::nullopt for none). Returns a Report of what could not be cut — nothing that would gouge is ever emitted; a feature the tools can't make is machined as far as possible and reported instead. The job changes only on success: what the kernel otherwise refuses (a drill as end_mill, a drills entry that isn't a drill, a tool number clashing with one already in the job, part outside the stock, a skin negative or not less than the part's height, no level found, a stepover or stepdown out of range, an empty list of end mills, one not smaller than the one before it, two sharing a number) returns an Error in its Result and leaves the job exactly as it was.

The list of end mills is a separate call: machine_with(part, end_mills, ...); machine takes the one.

Job::operations()

Result<std::vector<Operation>> operations() const

Every operation added to this job so far, in order — whether by Job::face(), Job::contour(), Job::pocket(), Job::drill() or Job::machine() — as a list of Operation.

Job.show

Play the job on its stock with the GPU view library, in the one shared window, from its start at real time, and return at once. The window's keys drive it — space plays or pauses, left and right step a move, up and down multiply the speed by 4 or divide it, Home and End seek the start and the end, L loops — and its title is the status line (move 370 of 638 · T1 flat 6 mm · X12.3 Y-4.0 Z7.0). part, a Solid, colours the stock by deviation from it. The terminal library cannot cut a stock and refuses. In the notebook, draw with show(job, part).

Not in this wrapper yet: play a job's programs with its View's machining view (show_machining in this wrapper's spelling) instead.

Job.view

Job.show in a fresh window that blocks until it is closed; returns the camera and the last pick, as Solid::view() does.

Not in this wrapper yet: play a job's programs with its View's machining view (show_machining in this wrapper's spelling) instead.

Job.stock

The stock's box as the job holds it, ((min_x, min_y, min_z), (max_x, max_y, max_z)) — what Stock::box() was given, or what Stock::around() worked out.

Not in this wrapper yet.

Job.tools

The tools this job was given — by Job::face(), Job::contour(), Job::pocket(), Job::drill() and Job::machine() (the end mill and drills its operations use; it refuses two different tools offered under one number) — by Grbl number, so a Program's tool finds its tool. A refused call adds none. A new mapping each time.

Not in this wrapper yet.

Report

struct Report

What Job::machine() could not make: a read-only sequence of ReportItem, in the order found, read once when machine returns. len(report) counts the items, it iterates and indexes them, and str(report) is the kernel's own text — one line per item, or "nothing left uncut"; bool(report) is true when it has items.

Report item

struct ReportItem

One thing Job::machine() left uncut, one of Report's items. Read-only.

ReportItem::kind

std::string kind

"corner" (material the end mill doesn't reach), "hole" (a round hole no drill matches or a matched drill can't make), "slope" (a face that is neither horizontal nor vertical, cut as steps), "undercut" (material under an overhang), "too_deep" (a level below the end mill's flute length, cut only that far) or "relief" (an inside corner cut beyond the part on purpose — a dog-bone, corner_relief).

ReportItem::at

Vec3 at

The item's XYZ location — a centroid for an area, the axis point at the top for a hole.

ReportItem::size

double size

An area in mm^2 for corner/undercut, a diameter in mm for hole, a height in mm (its Z range) for slope and too_deep, and the notch depth in mm for relief.

ReportItem::reason

std::string reason

One sentence naming the cause and the tool involved.

ReportItem::top

double top

The highest Z the item stands at: a corner's or undercut's band top, a hole's top, a slope's top, or for too_deep the flutes' reach.

ReportItem::bottom

double bottom

The lowest Z the item stands down to: the floor a corner or undercut reaches, a hole's floor, a slope's foot, or for too_deep the level.

ReportItem::region

std::vector<Profile> region

The XY area the item covers, as a list of Profile: a corner's or undercut's piece, a hole's disc, the area a slope's face covers, or for too_deep the reachable area cut short (the whole stock when it is the part's top).

Operation

struct Operation

One operation of a Job, read back by Job::operations(). Read-only.

Operation::kind

std::string kind

"face", "contour", "pocket" or "drill".

Operation::tool

std::uint32_t tool

Its Grbl T number.

Operation::params

std::map<std::string, std::optional<double>> params

A dict of the operation's own arguments, in the kind-specific order it stores them — z, top, bottom, stepover, stepdown, side, climb, open, peck and the point count, with a profile summarised by its bounds. side reads as "outside"/"inside"/"on"; climb and open as a bool; points as an int; a NaN peck as std::nullopt; every other value stays a float.

A std::map<std::string, std::optional<double>> of the library's own numbers, sorted by name: side is 0 outside, 1 inside or 2 on its line; climb and open are 1 or 0; points is a count; a peck of none is std::nullopt.

Sketches

class Sketch

A 2D sketch of points, lines, circles, arcs and free curves (Bezier, conic, NURBS), held by geometric constraints and dimensions and solved on request — the sketcher a parametric part starts from. Draw roughly, constrain, Sketch::solve(), then hand Sketch::profiles() to Solid::extrude() or any other verb that takes a Profile.

Entities and constraints are named by integer ids, which are never reused. Entity kinds are "point", "line", "circle", "arc" and "free_curve"; a constraint's kind is the name of the method that added it ("point_line_distance", ...), but for Sketch::radius_of(), whose kind is "radius". Lengths are the kernel's own unitless numbers, angles radians. A sense is "auto" (taken from the geometry when the constraint is added), "positive" (a line and a circle: the centre on the left of the line, from its first point to its second; two circles: touching from outside) or "negative" (the centre on the right; one circle inside the other); an end is "start" or "end".

A constraint that conflicts with the ones already there is refused when it is added, the refusal naming the constraints it fights, so a sketch is never left over-constrained by an edit; a redundant one (already implied) is kept and reported by Sketch::diagnose(). An edit that will not converge (Sketch::set_value(), Sketch::set_driving()) rolls the sketch back to where it was. Close it when done, or let the language's scope do it; see Lifetimes.

In Python an unknown sense or end name raises ValueError; every other wrapper raises its kernel error.

Sketch::from_profile()

static Result<Sketch> from_profile(const Profile& profile, bool infer = true, std::optional<double> tolerance = 1e-6)

A sketch of profile's lines, arcs and curves, joined end to end by coincident constraints, holes included. With infer (the default) it also adds every constraint the geometry already meets within tolerance — horizontal and vertical lines, tangent joints, concentric arcs, equal radii — so the profile comes back as a sketch a designer can dimension. Ends within tolerance (1e-6 by default) count as joined.

Sketch::close()

void close() noexcept

Free this handle now. The garbage collector, or the language's scope, does it otherwise.

Sketch::add_point()

Result<std::uint32_t> add_point(double x, double y)

A free point at (x, y): its id. A coordinate that is not finite returns an Error in its Result.

Sketch::add_line()

Result<std::uint32_t> add_line(std::uint32_t a, std::uint32_t b)

A line from the point a to the point b: its id. Refused for ids that are not two distinct points.

Sketch::add_circle()

Result<std::uint32_t> add_circle(std::uint32_t centre, double r)

A circle of radius r about the point centre: its id. Refused for a radius that is not positive and finite.

Sketch::add_arc()

Result<std::uint32_t> add_arc(std::uint32_t centre, std::uint32_t start, std::uint32_t end)

A counter-clockwise arc about the point centre from the point start to the point end: its id. Its radius is start's distance from centre; end is held on that circle by the solve, not moved there now. The three must be different points.

Sketch::add_bezier()

Result<std::uint32_t> add_bezier(std::uint32_t start, const Vec2& c1, const Vec2& c2, const Vec2& to)

A cubic Bezier free curve from the point start through the controls c1 and c2 (each an (x, y) pair) to a new end point at to: its id. The curve owns its control and end points (Sketch::ends() lists them), which constraints and drags move like any other point.

Sketch::add_conic()

Result<std::uint32_t> add_conic(std::uint32_t start, const Vec2& control, const Vec2& to, double weight)

A rational quadratic (conic) free curve from the point start with the control control of weight to a new end point at to: its id. A weight below 1 is an ellipse's arc, 1 a parabola, above 1 a hyperbola.

Sketch::add_nurbs()

Result<std::uint32_t> add_nurbs(std::uint32_t start, const std::vector<Vec2>& points, const std::vector<double>& knots, std::uint32_t degree = 3, const std::optional<std::vector<double>>& weights = std::nullopt)

A NURBS free curve of degree (3 by default) from the point start through the control points after it, on knots: its id. weights is std::nullopt for a plain B-spline, or one per control point counting the start (one more than points holds); any other count, a negative degree, or knots that do not fit the points and the degree, returns an Error in its Result.

points is a std::vector<Vec2>; degree a std::uint32_t, so never negative; weights a std::optional<std::vector<double>>, std::nullopt for none.

Sketch::add_rect()

Result<SketchRect> add_rect(const Vec2& a, const Vec2& b)

The rectangle with opposite corners a and b, as two lists: its four corner points, counter-clockwise from a, and its four sides (side i runs from corner i to corner i + 1). Its sides come held level and plumb by two horizontal and two vertical constraints, so a fix and two lengths constrain it fully.

a and b are Vec2s; returns a Result<SketchRect>, a struct of corners and sides, each a std::array<std::uint32_t, 4>.

Sketch::kind()

Result<std::string> kind(std::uint32_t id) const

The kind of entity id: "point", "line", "circle", "arc" or "free_curve". An unknown or removed id returns an Error in its Result.

Sketch::entities()

Result<std::vector<std::uint32_t>> entities() const

The live entity ids, ascending.

Sketch::point()

Result<Vec2> point(std::uint32_t id) const

The point id's position, as an (x, y) pair. Not a point, returns an Error in its Result.

Sketch::set_point()

Result<void> set_point(std::uint32_t id, double x, double y)

Moves the point id to (x, y) without solving — a raw write, as loading a saved sketch does.

Sketch::radius()

Result<double> radius(std::uint32_t id) const

The radius of the circle or arc id. (The RADIUS dimension is Sketch::radius_of().)

Sketch::set_radius()

Result<void> set_radius(std::uint32_t id, double r)

Sets the circle id's radius to r without solving. Refused for an arc, whose radius its points set, and for a radius that is not positive and finite.

Sketch::centre()

Result<std::uint32_t> centre(std::uint32_t id) const

The centre point of the circle or arc id.

Sketch::ends()

Result<std::vector<std::uint32_t>> ends(std::uint32_t id) const

The points entity id runs between: a line's [a, b], an arc's [start, end], a free curve's [start, controls..., end]. Refused for a point or a circle.

Sketch::set_construction()

Result<void> set_construction(std::uint32_t id, bool on = true)

Marks entity id as construction geometry (on, the default) or back: still solved and constrained, but never part of Sketch::profiles() or Sketch::open_chains().

Sketch::is_construction()

Result<bool> is_construction(std::uint32_t id) const

Whether entity id is construction geometry (false for an unknown id).

Sketch::is_reference()

Result<bool> is_reference(std::uint32_t id) const

Whether entity id is a reference copy of another sketch's, made by Sketch::reference() (false for an unknown id).

Sketch::remove_entity()

Result<std::vector<std::uint32_t>> remove_entity(std::uint32_t id)

Removes entity id, each of its points no other entity uses, and every constraint on any of them: the removed constraint ids, ascending. A point a line, circle, arc or curve still uses is refused, returns an Error in its Result naming those entities. Nothing is solved.

Sketch::reference()

Result<std::uint32_t> reference(const Sketch& other, std::uint32_t entity)

A fixed construction copy of other's entity entity in this sketch, its id: something to dimension against that this sketch's solve never moves. Sketch::update_reference() re-reads it. other must be a different sketch.

Sketch::update_reference()

Result<SolveReport> update_reference(std::uint32_t id, const Sketch& other)

Re-reads the reference id from other (where other's solve has moved it) and re-solves this sketch, as a SolveReport.

Sketch::coincident()

Result<std::uint32_t> coincident(std::uint32_t a, std::uint32_t b)

The points a and b at one place. Each constraint method returns the new constraint's id, and refuses one that conflicts with the sketch, returns an Error in its Result.

Sketch::point_on_line()

Result<std::uint32_t> point_on_line(std::uint32_t point, std::uint32_t line)

The point point on the line line, taken as infinite.

Sketch::point_on_circle()

Result<std::uint32_t> point_on_circle(std::uint32_t point, std::uint32_t circle)

The point point on the circle circle, or on an arc's whole circle.

Sketch::horizontal()

Result<std::uint32_t> horizontal(std::uint32_t a, std::uint32_t b)

The points a and b level with each other (one y).

Sketch::vertical()

Result<std::uint32_t> vertical(std::uint32_t a, std::uint32_t b)

The points a and b one above the other (one x).

Sketch::parallel()

Result<std::uint32_t> parallel(std::uint32_t a, std::uint32_t b)

The lines a and b parallel, either way round.

Sketch::perpendicular()

Result<std::uint32_t> perpendicular(std::uint32_t a, std::uint32_t b)

The lines a and b at right angles.

Sketch::collinear()

Result<std::uint32_t> collinear(std::uint32_t a, std::uint32_t b)

Line b's two ends on line a, taken as infinite.

Sketch::tangent()

Result<std::uint32_t> tangent(std::uint32_t a, std::uint32_t b, const std::string& sense = "auto")

A line and a circle or arc, or two circles or arcs, tangent; sense picks the side ("auto": the side they are on now). Where the two meet end to end — the ends one point, or held together by a coincident when the tangent is added — it is held at that joint instead, their directions there running on smoothly, and sense plays no part (Sketch::is_joint_tangent()).

Sketch::tangent_at_end()

Result<std::uint32_t> tangent_at_end(std::uint32_t curve, std::uint32_t other, const std::string& end = "start")

The free curve curve's handle at its end ("start" or "end") along other when that is a line, or square to its radius at the curve's end when it is a circle or an arc.

Sketch::concentric()

Result<std::uint32_t> concentric(std::uint32_t a, std::uint32_t b)

The circles or arcs a and b about one centre.

Sketch::equal_length()

Result<std::uint32_t> equal_length(std::uint32_t a, std::uint32_t b)

The lines a and b the same length.

Sketch::equal_radius()

Result<std::uint32_t> equal_radius(std::uint32_t a, std::uint32_t b)

The circles or arcs a and b the same radius.

Sketch::midpoint()

Result<std::uint32_t> midpoint(std::uint32_t point, std::uint32_t line)

The point point at the middle of the line line.

Sketch::symmetric()

Result<std::uint32_t> symmetric(std::uint32_t a, std::uint32_t b, std::uint32_t about)

The points a and b mirror images of each other across the line about.

Sketch::fix()

Result<std::uint32_t> fix(std::uint32_t entity)

Every parameter of entity held where it is now: a point's position, a circle's centre and radius, ...

Sketch::distance()

Result<std::uint32_t> distance(std::uint32_t a, std::uint32_t b, double value, bool driving = true)

The points a and b value apart. Every dimension takes driving: true (the default) sets the geometry, false only reports what it measures (Sketch::measure()), never conflicting.

Sketch::point_line_distance()

Result<std::uint32_t> point_line_distance(std::uint32_t point, std::uint32_t line, double value, bool driving = true, const std::string& sense = "auto")

The point point value from the line line (taken as infinite), on the side sense says.

Sketch::line_distance()

Result<std::uint32_t> line_distance(std::uint32_t a, std::uint32_t b, double value, bool driving = true, const std::string& sense = "auto")

Line b's start value from line a, on the side sense says — with Sketch::parallel(), the gap between two lines. It is measured from the second line's start point, not from the line as a whole.

Sketch::circle_line_distance()

Result<std::uint32_t> circle_line_distance(std::uint32_t circle, std::uint32_t line, double value, bool driving = true, const std::string& sense = "auto")

The circle circle's rim value from the line line (its centre's distance less the radius), on the side sense says.

Sketch::circle_distance()

Result<std::uint32_t> circle_distance(std::uint32_t a, std::uint32_t b, double value, bool driving = true)

The circles a and b value apart rim to rim: their centres' distance less both radii, negative where they overlap.

Sketch::horizontal_distance()

Result<std::uint32_t> horizontal_distance(std::uint32_t a, std::uint32_t b, double value, bool driving = true)

b's x less a's, signed, equal to value.

Sketch::vertical_distance()

Result<std::uint32_t> vertical_distance(std::uint32_t a, std::uint32_t b, double value, bool driving = true)

b's y less a's, signed, equal to value.

Sketch::length()

Result<std::uint32_t> length(std::uint32_t line, double value, bool driving = true)

The line line value long.

Sketch::angle()

Result<std::uint32_t> angle(std::uint32_t a, std::uint32_t b, double value, bool driving = true)

The angle counter-clockwise from line a's direction to line b's, value radians.

Sketch::radius_of()

Result<std::uint32_t> radius_of(std::uint32_t circle, double value, bool driving = true)

The circle or arc circle's radius value: the RADIUS dimension, kind "radius", named apart from Sketch::radius(), which reads a radius.

Sketch::diameter()

Result<std::uint32_t> diameter(std::uint32_t circle, double value, bool driving = true)

The circle or arc circle's diameter value.

Sketch::smooth()

Result<std::uint32_t> smooth(std::uint32_t a, std::uint32_t b)

Two curves joined end to end with matching tangent and curvature (G2): each a line, an arc or a free curve, at least one a free curve, meeting at an end (one point, or held together by a coincident). A free curve must be clamped at that end; two arcs, or a line and an arc, are refused, as there is no curvature to match. Kind "smooth".

Sketch::translated()

Result<std::uint32_t> translated(std::uint32_t a, std::uint32_t b, std::uint32_t from, std::uint32_t to)

The point b held at the point a moved by the step from the point from_ to the point to (b - a = to - from_): what a rectangular pattern holds each copied point with. Kind "translated".

Sketch::rotated()

Result<std::uint32_t> rotated(std::uint32_t a, std::uint32_t b, std::uint32_t centre, std::uint32_t from, std::uint32_t to)

The point b held at the point a turned about the point centre by the turn that takes from_ to to: what a circular pattern holds each copied point with. from_ or to the same point as centre is refused. Kind "rotated".

Sketch::add_polygon()

Result<SketchPolygon> add_polygon(const Vec2& centre, const Vec2& vertex, std::uint32_t sides)

A regular polygon of sides (3 to 1024) about the point centre, its corner 0 at vertex, as a SketchPolygon: the sides held equal, with a construction circumcircle through the corners and a construction incircle tangent to side 0, both about the one centre point. Four degrees of freedom are left (centre, size, rotation); dimension either circle to size it. centre and vertex must be apart. A refusal leaves the sketch as it was.

Sketch::chamfer()

Result<SketchChamfer> chamfer(std::uint32_t a, std::uint32_t b, double da, double db)

Cuts the corner where the lines a and b meet, da along a and db along b from the corner, as a SketchChamfer. The two lines are trimmed to the new ends and a new line joins them; the old corner stays as a construction point (the virtual sharp, on both lines) with the two distances as driving dimensions, so the degrees of freedom are unchanged. The lines must meet at an end and not be parallel, neither a reference, each distance positive and shorter than its line, and no tangent or smooth held at that end. A length dimension on a trimmed line now measures the trimmed line. A refusal, or a solve that fails, leaves the sketch as it was.

Sketch::chamfer_angle()

Result<SketchChamfer> chamfer_angle(std::uint32_t a, std::uint32_t b, double da, double angle)

As Sketch::chamfer(), with da along a and angle (radians) the interior angle at the new point on a between a and the chamfer; the second dimension is that angle. The angle must leave a chamfer shorter than b allows.

Sketch::pattern_rectangular()

Result<SketchPattern> pattern_rectangular(const std::vector<std::uint32_t>& entities, const Vec2& d1, std::uint32_t n1, const Vec2& d2 = {0.0, 0.0}, std::uint32_t n2 = 1)

Copies entities (any kinds) into a grid of n1 by n2 instances, the source counted, d1 and d2 each an (x, y) step, as a SketchPattern. Each copied point is held to the one before it by Sketch::translated(); the first step along each direction is set by driving horizontal and vertical distances, so set_value on one respaces the whole grid and a fully constrained sketch stays so. Construction flags are copied. n1, n2 at least 1, n1 * n2 at least 2 and at most 10 000 instances; an entity dead or given twice is refused, and the sketch left as it was.

Sketch::pattern_circular()

Result<SketchPattern> pattern_circular(const std::vector<std::uint32_t>& entities, std::uint32_t centre, std::uint32_t count, double step)

Copies entities round the point centre: count instances (at least 2, the source counted), each turned step radians counter-clockwise from the last, as a SketchPattern. Each copied point is held by Sketch::rotated(); two construction lines from the centre and a driving angle dimension carry the step, so set_value on it respaces the copies. A first point of the source on centre, or a step of 0, is refused and the sketch left as it was.

Sketch::mirror()

Result<SketchMirror> mirror(const std::vector<std::uint32_t>& entities, std::uint32_t line)

Copies entities (any kinds) reflected across the line line, as a SketchMirror. Each copied point is held to its source by Sketch::symmetric() about the line, a copied circle or arc by Sketch::equal_radius(); a point on the line is shared, not copied, and held by Sketch::point_on_line() unless it is one of the line's ends. Construction flags are copied and the sketch is solved. line must be a line and not among entities; a refusal leaves the sketch as it was.

Sketch::auto_constrain()

Result<std::vector<std::uint32_t>> auto_constrain(double tolerance = 0.0, bool dimensions = false)

Adds the constraints the geometry already satisfies within tolerance (0 or std::nullopt takes 1e-6 of the sketch's extent), as the new constraint ids, ascending: coincident ends, horizontal and vertical lines, tangents at joined ends, parallel, perpendicular, concentric, equal radius and length, midpoints and points on lines and circles. A candidate is kept only where it removes a degree of freedom without being redundant or conflicting. With dimensions, driving dimensions at the measured values follow (radii, lengths, angles, an anchor and the distances to it) until nothing is left free. One diagnosis runs per candidate: fine for hand-sized sketches. A failed solve leaves the sketch as it was.

Sketch::constraints()

Result<std::vector<std::uint32_t>> constraints() const

The live constraint ids, ascending.

Sketch::constraint_kind()

Result<std::string> constraint_kind(std::uint32_t id) const

The kind of constraint id, e.g. "point_line_distance". An unknown or removed id returns an Error in its Result.

Sketch::constraint_refs()

Result<std::vector<std::uint32_t>> constraint_refs(std::uint32_t id) const

The entity ids constraint id was made on, in the order they were given.

Sketch::constraint_value()

Result<std::optional<double>> constraint_value(std::uint32_t id) const

The value of the dimension id; std::nullopt for a constraint that is not a dimension. An unknown id returns an Error in its Result.

A Result<std::optional<double>>: std::nullopt for a constraint that is not a dimension.

Sketch::constraint_driving()

Result<bool> constraint_driving(std::uint32_t id) const

Whether the dimension id drives the geometry; false for a constraint that is not a dimension. An unknown id returns an Error in its Result.

Sketch::constraint_sense()

Result<std::string> constraint_sense(std::uint32_t id) const

The sense of constraint id as the sketch holds it, "auto" resolved to the side it took; "auto" for a kind without one.

Sketch::constraint_end()

Result<std::string> constraint_end(std::uint32_t id) const

The end ("start" or "end") of the free curve a Sketch::tangent_at_end() constraint id holds; "start" for a kind without one. An unknown id returns an Error in its Result.

Sketch::is_joint_tangent()

Result<bool> is_joint_tangent(std::uint32_t id) const

Whether the tangent id is held at a joint (two curves meeting end to end) rather than as a touch; false for any other constraint.

Sketch::remove()

Result<void> remove(std::uint32_t id)

Removes the constraint id. Nothing is solved; a joint tangent the removed coincident held goes back to a touch.

Sketch::set_value()

Result<SolveReport> set_value(std::uint32_t id, double value)

Sets the dimension id to value and re-solves, as a SolveReport. One that will not converge is refused, returns an Error in its Result, and the sketch is left as it was.

Sketch::set_driving()

Result<SolveReport> set_driving(std::uint32_t id, bool driving)

Makes the dimension id drive the geometry (true) or only report it, and re-solves, as a SolveReport. Made driving, it first takes the value it measures now, so nothing moves; one that would conflict is refused and the sketch left as it was.

Sketch::measure()

Result<double> measure(std::uint32_t id) const

What the geometry measures for the dimension id right now, driving or not.

Sketch::solve()

Result<SolveReport> solve()

Solves the sketch, as a SolveReport. Each independent part is solved alone, every point moving as little as it can; a part that conflicts or does not converge is put back where it was and named in the report — reported, not raised.

Sketch::drag()

Result<SolveReport> drag(const std::vector<std::pair<std::uint32_t, Vec2>>& moves)

Drags each point id in moves (a mapping of id to (x, y)) towards its target while the constraints hold, as a pointer drag does, as a SolveReport: the dragged points go where they can and everything else moves as little as it can; a fully constrained point stays put. An id that is not a point returns an Error in its Result. The moves are sent in ascending id order, whatever order they are given in, and an id given twice is refused where the language can hold one (sketch_drag: point <id> given twice).

moves is a std::vector<std::pair<std::uint32_t, Vec2>>: each point's id and its target; an id given twice is refused.

Sketch::diagnose()

Result<Dof> diagnose()

The sketch's degrees of freedom, as a Dof: whole and per independent part.

Sketch::profiles()

Result<std::vector<Profile>> profiles(std::optional<double> tolerance = 1e-6) const

The closed loops among the solved, non-construction curves, as Profile values of exact segments (lines, arcs, the free curves' own shapes); a loop inside another becomes its hole. Ends within tolerance (1e-6 by default) join.

Sketch::open_chains()

Result<std::vector<Profile>> open_chains(std::optional<double> tolerance = 1e-6) const

The chains of curves that do not close, as open Profile values — sweep paths; ends within tolerance join.

SolveReport

struct SolveReport

What a Sketch::solve(), Sketch::drag(), Sketch::set_value(), Sketch::set_driving() or Sketch::update_reference() did, as plain data.

SolveReport::status

std::string status

"converged", "conflicting" (constraints that cannot all hold) or "diverged" (no solution found within the iteration budget). The library hands the number back as a double and every wrapper converts it exactly: a value that is not a whole number in range is an error naming the call, never a status.

SolveReport::converged()

bool converged() const

Whether status is "converged".

SolveReport::iterations

int iterations

The most solver iterations any one part took (each part is solved alone).

SolveReport::max_residual

double max_residual

The largest constraint residual left, scaled by the sketch's size; 0 when nothing was left to solve.

SolveReport::ids

std::vector<std::uint32_t> ids

The constraints a conflict ran into, or the worst ones of a diverged solve; empty when it converged.

Dof

struct Dof

A sketch's degrees of freedom, as Sketch::diagnose() returns them: plain data, read after a solve. A sketch is "under" constrained while something can still move, "full" when nothing can and nothing fights, "over" when constraints fight.

Dof::free

int free

How many degrees of freedom are left: the unknowns less the rank of the constraint equations. The counts arrive as doubles and are converted exactly: a value that is not a whole number in range is an error naming the call, never a state.

Dof::state

std::string state

"under", "full" or "over".

Dof::redundant

std::vector<std::uint32_t> redundant

The constraint ids already implied by earlier ones — harmless, kept.

Dof::conflicting

std::vector<std::uint32_t> conflicting

The constraint ids that fight earlier ones.

Dof::free_entities

std::vector<std::uint32_t> free_entities

The entity ids that can still move, ascending (references never).

Dof::parts

std::vector<PartDof> parts

The independent parts the sketch splits into, as PartDof values: each solved, and dragged, alone.

PartDof

struct PartDof

One independent part of a diagnosed sketch — constraints and the unknowns they share, solved apart from the rest: one of Dof::parts. Plain data.

PartDof::params

int params

How many unknowns the part has.

PartDof::free

int free

How many of them stay free.

PartDof::state

std::string state

"under", "full" or "over".

PartDof::constraints

std::vector<std::uint32_t> constraints

The constraint ids in the part, in the order they were added.

PartDof::redundant

std::vector<std::uint32_t> redundant

Its constraints already implied by earlier ones.

PartDof::conflicting

std::vector<std::uint32_t> conflicting

Its constraints that fight earlier ones.

PartDof::free_entities

std::vector<std::uint32_t> free_entities

Its entities that can still move; a curve whose points lie in two parts may be in both.

Garments

A garment: patterns (a closed outline, a fabric, a grain and a seam allowance, placed by a frame), the seams that sew arc-length ranges of two patterns together, and the fabrics, with CLO-compatible parameters — the flat pattern a cloth simulation starts from. Lengths are millimetres in the session API. Patterns, seams and fabrics are named by integer ids, which are never reused. A fabric is twenty numbers in the order of Garment.FABRIC_FIELDS (stretch_warp, ..., internal_damping); a notch kind is NOTCH_SLIT, NOTCH_V, NOTCH_T, NOTCH_CASTLE or NOTCH_U; an internal line is LINE, FOLD or DART.

A refused call raises the kernel's error with the call's name first (garment_add_seam: unknown pattern 9). The lists the library lends are copied before a call returns, so they survive later edits. Close it when done, or let the language's scope do it; see Lifetimes.

A garment is also a Document node's value: garment.fabric, garment.pattern, garment.seam and garment.garment nodes evaluate to one, read with Document.result_garment.

Not in this wrapper yet.

Garment.FABRIC_PARAMS

How many numbers a fabric has: 20.

Not in this wrapper yet.

Garment.FABRIC_FIELDS

The names of a fabric's twenty parameters, in order: stretch_warp, stretch_weft, shear_left, shear_right, bending_warp, bending_weft, bending_bias_left, bending_bias_right, the four buckling_ratio_*, the four buckling_stiffness_*, density, thickness, friction and internal_damping.

Not in this wrapper yet.

Garment.from_aama

A garment read from AAMA DXF text: its patterns over one fabric, id 0, called "imported", with all-zero parameters. Text that is not AAMA DXF returns an Error in its Result.

Not in this wrapper yet.

Garment.close

Free this handle now. Leaving a with block or the garbage collector does the same.

Not in this wrapper yet.

Garment.add_fabric

A fabric called name with its twenty parameters, as a list in FABRIC_FIELDS order or a dict keyed by those names: its id. A negative parameter is reported by Garment.validate.

Not in this wrapper yet.

Garment.fabric_params

Fabric fabric's twenty parameters, in FABRIC_FIELDS order. An unknown id returns an Error in its Result.

Not in this wrapper yet.

Garment.fabric_name

Fabric fabric's name. An unknown id returns an Error in its Result.

Not in this wrapper yet.

Garment.fabrics

The live fabric ids, ascending.

Not in this wrapper yet.

Garment.add_pattern

A pattern called name over the closed outline (its holes are kept), with the grain direction (x, y), a fabric id, a layer (stacking order) and the seam allowance: one width for every side, or one per side. Its id. The pattern starts on the origin, flat. An unknown fabric or an allowance count that fits neither returns an Error in its Result; a zero grain is reported by Garment.validate.

Not in this wrapper yet.

Garment.pattern_name

Pattern pattern's name.

Not in this wrapper yet.

Garment.pattern_outline

Pattern pattern's outline, as a new Profile.

Not in this wrapper yet.

Garment.pattern_info

Pattern pattern's (grain_x, grain_y, fabric, layer).

Not in this wrapper yet.

Garment.pattern_allowance

Pattern pattern's seam allowances, one per side.

Not in this wrapper yet.

Garment.pattern_frame

The frame pattern pattern is placed by: its origin, then its x, y and z axes, as four points.

Not in this wrapper yet.

Garment.pattern_set_frame

Places pattern pattern by frame: twelve numbers, the origin then the x, y and z axes.

Not in this wrapper yet.

Garment.pattern_set_wrap

Wraps pattern pattern round a cylinder: seven numbers, the axis origin, the axis direction and the radius. std::nullopt clears the wrap.

Not in this wrapper yet.

Garment.pattern_add_notch

Adds a notch to pattern pattern at arc length at, of kind (Garment.NOTCH_*) and depth. An arc length outside the outline is reported by Garment.validate; a position or depth that is not finite returns an Error in its Result.

Not in this wrapper yet.

Garment.pattern_notches

Pattern pattern's notches, as (at, kind, depth) triples.

Not in this wrapper yet.

Garment.pattern_add_internal

Adds an internal line to pattern pattern: kind (LINE, FOLD or DART), path a Profile read as an open path: the profile's segments are copied as given (a closed profile keeps its closing segment); holes are ignored.

Not in this wrapper yet.

Garment.remove_pattern

Removes pattern pattern and every seam that names it.

Not in this wrapper yet.

Garment.patterns

The live pattern ids, ascending.

Not in this wrapper yet.

Garment.add_seam

Sews pattern a between arc lengths a_from and a_to to pattern b between b_from and b_to, reversed when one runs against the other: its id. An unknown pattern returns an Error in its Result.

Not in this wrapper yet.

Garment.seam

Seam seam read back, as a GarmentSeam.

Not in this wrapper yet.

Garment.remove_seam

Removes seam seam.

Not in this wrapper yet.

Garment.seams

The live seam ids, ascending.

Not in this wrapper yet.

Garment.validate

Checks the garment, measuring outlines to accuracy (a fraction in (0, 1), 0.01 by default), and returns the issues found as Issue values, an empty list for a garment that is clean. Any edit afterwards clears them.

Not in this wrapper yet.

Garment.issue

Issue index of the last Garment.validate, as an Issue. Before a validation, or past the last issue, returns an Error in its Result.

Not in this wrapper yet.

Garment.cut_line

Pattern pattern's cut line (the outline offset by its allowance) flattened to tolerance (0.1 by default), as (x, y) points.

Not in this wrapper yet.

Garment.range_points

The points of pattern pattern's outline between arc lengths start and end, flattened to tolerance (0.1 by default), as (x, y) points.

Not in this wrapper yet.

Garment.to_aama

The patterns as AAMA DXF text, curves flattened to tolerance (0.1 by default), with author in the header when given. The text is written as metric, so a garment from a non-millimetre document must be converted to millimetres first.

Not in this wrapper yet.

Issue

One thing Garment.validate found, as a named tuple. severity is Garment.ERROR or Garment.WARNING; kind what was found (Garment.SEAM_OVERLAP, Garment.SEAM_LENGTH_MISMATCH, ...); ratio the length ratio of a seam length mismatch, std::nullopt for every other kind; message the issue in words, naming the parts.

Not in this wrapper yet.

GarmentSeam

A seam read back by Garment.seam, as a named tuple: pattern a's arc-length range a_from to a_to sewn to pattern b's b_from to b_to, reversed when one range runs against the other.

Not in this wrapper yet.

Cloth

A cloth: a Garment simulated on an avatar. The garment's patterns are meshed and arranged round the avatar; each step then sews and drapes at once: the seam pairs pull together and weld while gravity pulls the cloth down. Gravity acts from the first frame, so a garment is usually sewn with it off and draped after: create the cloth with gravity=(0, 0, 0) (in C, the options gravity.x, gravity.y and gravity.z, indices 4 to 6, at 0), step about 60 frames until status().welded_pairs reaches status().seam_pairs, then set_options back to the defaults and step on to drape. Each seam pair closes at most at sewing_speed; a pair that stops closing short of the weld distance (where three or four pieces meet, the welded neighbours' tension can hold it there) gets a pull that grows over a few frames until it welds. Units are grams, millimetres and seconds, as the garment's.

avatar is None (no body: the cloth only falls), the bytes of a binary or ASCII STL file, or (positions, indices): xyz triples and index triples. options overrides Cloth.default_options() by the kernel's own names. The cloth does not keep the garment: a later edit to it changes nothing until Cloth.remesh_pattern. Close it when done, or let the language's scope do it; see Lifetimes.

The options are twenty numbers, in the order of Cloth.OPTION_FIELDS: particle_distance, frame_dt, substeps, iterations, gravity.x, gravity.y, gravity.z, damping, local_damping, air_drag, air_lift, air_density, sewing_stiffness, sewing_speed, weld_distance, avatar_thickness, self_thickness, self_stiffness, self_collision and drag_stiffness. The gravity components are the dotted names gravity.x, gravity.y and gravity.z; options and set_options also take all three as one gravity=(x, y, z), as in set_options(gravity=(0, 0, 0)) (not both spellings at once). particle_distance is the mesh spacing in mm and is fixed once the cloth exists. self_thickness is the *minimum* contact thickness of the cloth against itself: a fabric thicker than it separates at its own thickness, a thinner one at this, and it must stay below weld_distance so that seams still close.

A blown-up simulation does not raise: read Cloth.status. non_finite counts the particles whose position or velocity is not finite, dropped the self-collision elements that were too large or not finite to be hashed, and max_speed is the fastest finite particle in mm/s; a healthy cloth has non_finite and dropped at zero.

The lists the library lends (positions, triangles, links) are borrowed from the cloth in the C ABI and stay valid only until the next call on the same cloth; this wrapper copies them before a call returns, so they survive step and Cloth.remesh_pattern, which can change the vertex and triangle counts: read the lists again afterwards. A refused call raises the kernel's error with the call's name first (cloth_pin: vertex 9999 is not a sim vertex (2731 vertices)).

On the GPU: in the browser, a WebGPU View steps a cloth on the graphics card and writes its vertices straight into what it draws — showCloth(cloth) shows and uploads it, stepCloth(id, frames) steps it, clothPositions(id) and clothHealth(id) read it back (promises), and pinCloth, unpinCloth, dragCloth and setClothOptions edit it; clothGpu is false on WebGL2, where the cloth stays on the CPU. Not in this wrapper yet: the GPU cloth is the web View's only, the View's C ABI and the other wrappers come later. By default the GPU also runs the intersection analysis that untangles a cloth caught through itself, as the CPU does; showCloth(cloth, {gia: false}) turns it off on the GPU, a little faster (a T-shirt drapes at about 31 fps against 30).

Not in this wrapper yet.

Cloth.OPTION_FIELDS

The names of the twenty options, in order: particle_distance, frame_dt, substeps, iterations, gravity.x, gravity.y, gravity.z, damping, local_damping, air_drag, air_lift, air_density, sewing_stiffness, sewing_speed, weld_distance, avatar_thickness, self_thickness, self_stiffness, self_collision and drag_stiffness.

Not in this wrapper yet.

Cloth.STATUS_FIELDS

The names of ClothStatus's eight fields, in order: frame, vertices, triangles, seam_pairs, welded_pairs, non_finite, dropped and max_speed.

Not in this wrapper yet.

Cloth.close

Free this handle now. Leaving a with block or the garbage collector does the same.

Not in this wrapper yet.

Cloth.default_options

The options a new cloth starts with, as a dict keyed by OPTION_FIELDS name: particle_distance, frame_dt, substeps, iterations, gravity.x, gravity.y, gravity.z, damping, local_damping, air_drag, air_lift, air_density, sewing_stiffness, sewing_speed, weld_distance, avatar_thickness, self_thickness, self_stiffness, self_collision and drag_stiffness.

Not in this wrapper yet.

Cloth.options

The cloth's current options, keyed as Cloth.default_options.

Not in this wrapper yet.

Cloth.set_options

Merges changes (by option name, or gravity as one (x, y, z), as in set_options(gravity=(0, 0, 0))) into the current options. particle_distance cannot change, and a refused set (an unknown name, a self_thickness or fabric thickness that is not below weld_distance) returns an Error in its Result and leaves the options as they were.

Not in this wrapper yet.

Cloth.step

Advances the simulation by frames frames (1 by default), each frame_dt seconds, sewing and draping together under the current options (sew with gravity off first: see Cloth). Check Cloth.status afterwards for a blow-up.

Not in this wrapper yet.

Cloth.status

The simulation's state, as a ClothStatus.

Not in this wrapper yet.

Cloth.positions

The current position of every sim vertex, in mm, as (x, y, z) triples. A copy.

Not in this wrapper yet.

Cloth.rest

Each sim vertex's arranged starting position in 3D, in mm, as (x, y, z) triples. A copy.

Not in this wrapper yet.

Cloth.triangles

The sim mesh's triangles, as triples of vertex indices into Cloth.positions.

Not in this wrapper yet.

Cloth.vertex_patterns

The id of the garment pattern each sim vertex belongs to. Every sim vertex keeps its own pattern: a weld across a seam merges the two vertices' particles, not the vertices.

Not in this wrapper yet.

Cloth.pin

Pins vertex v at at (x, y, z in mm), or where it is now when std::nullopt. A pinned vertex does not move until Cloth.unpin. An unknown vertex returns an Error in its Result.

Not in this wrapper yet.

Cloth.unpin

Releases vertex v's pin. An unknown vertex returns an Error in its Result.

Not in this wrapper yet.

Cloth.drag

Pulls vertex v towards target (x, y, z in mm) with the drag_stiffness spring; std::nullopt releases the drag. An unknown vertex returns an Error in its Result.

Not in this wrapper yet.

Cloth.remesh_pattern

Meshes pattern pattern of garment again after its outline changed there, keeping the rest of the cloth where it is. The vertex and triangle counts may change: read the lists again. An unknown pattern returns an Error in its Result.

Not in this wrapper yet.

ClothStatus

The state of a simulation, as Cloth.status returns it, a named tuple: the frame count, the sim vertices and triangles, the seam_pairs in the sim mesh and the welded_pairs closed so far (sewing is done when welded_pairs == seam_pairs), then the health: non_finite live particles (a position or velocity that is not finite), dropped (the most hash elements one self-collision gather dropped during the last step, which only a blown-up state produces) and max_speed, the fastest finite particle, in mm/s. The counts are converted exactly; a cloth is healthy when non_finite and dropped are both zero.

Not in this wrapper yet.

Errors

using BuildError = Error

What the kernel refused, in its own words: a profile that crosses itself, a fillet too large for its faces, a boolean with nothing left. The call that failed returns it, as the Error in its Result.

Error::ids

std::vector<std::uint32_t> ids

The ids a Sketch refusal names, as a list: the constraints a new constraint, value or reference conflicts with (Sketch::coincident() and the other constraint methods, Sketch::set_value(), Sketch::set_driving(), Sketch::update_reference()), or the entities still using a point (Sketch::remove_entity()). Empty when the refusal names none, and for every error outside a sketch — so a sketcher's interface can mark the clash without reading the text.

Lifetimes

What borrows, what to close

Scene, Solid, Profile, Path and SweepPath are move-only and free themselves when destroyed; close() does it early. Every call that can fail returns a Result<T> — never an exception — and CADACLYSM_TRY(var, expr) carries the error up.

Node::mesh() hands back Spans over the scene's memory, valid until Scene::close(); copy() gives vectors of your own. Solid::mesh() instead returns a view that owns a tessellation of its own, built with the view and never replaced under it: nothing about it goes stale, whether the solid is meshed again at another tolerance or closed, so it carries no generation check either. A Span already in hand is a pointer and a length from then on, so hold the view while you read it, and copy() what must outlive the view itself. FemMesh is the other shape: a handle of your own, which Scene::close() neither frees nor stales, and whose accessors trap on a freed handle in both modes — that check guards a pointer handed to C, as Meshlets' does, not a view's owner.

Strings are always copied on the way out. A Scene may be read from several threads, and Scene::cancel() called from one while another runs Scene::realize_all(). A Solid caches its tessellation: do not share one between threads.