@metamesh/modeling 0.0.0-stage → 0.6.0

package/dist/engine/extrusion-finishing.js

@@ -0,0 +1,82 @@
+import { edgeTreatmentPointCount, edgeTreatmentSetbacks, sampleEdgeTreatment, } from "../geometry/edge-finishing.js";
+import { GeometryError } from "../geometry/errors.js";
+import { resolveExtrusionControls } from "../geometry/extrusion.js";
+import { assertMeshAllocationWithinLimits } from "../geometry/model-limits.js";
+import { assertSamplingCount } from "../geometry/sampling-limits.js";
+import { buildProfileLoftMesh } from "./profile-mesh.js";
+const fail = (message) => {
+    throw new GeometryError("INVALID_ARGUMENT", message, { operation: "extrude" });
+};
+/** Finishes inward convex extrusion rims with exact parallel-edge offsets and retained correspondence. */
+export function buildFinishedExtrusion(module, profile, options) {
+    const controls = resolveExtrusionControls(options.height, options, "extrude");
+    if (controls.twistDegrees !== 0 ||
+        controls.scales.some((scale) => scale !== 1) ||
+        options.divisions !== undefined)
+        fail("End treatments require a straight extrusion without twist, top scaling or divisions.");
+    if (typeof options.ends !== "object" || options.ends === null || Array.isArray(options.ends))
+        fail("ends must be an object.");
+    if (profile.components.length !== 1 || profile.components[0].holes.length !== 0)
+        fail("End treatments require one convex contour without holes; use explicit loft profiles for other topology.");
+    const contour = profile.components[0].outer, points = contour.points;
+    const edges = points.map((point, index) => {
+        const next = points[(index + 1) % points.length], dx = next[0] - point[0], dy = next[1] - point[1];
+        const length = Math.hypot(dx, dy);
+        if (!(length > 0) || !Number.isFinite(length))
+            fail("End treatment contours must have distinct finite vertices.");
+        return [dx / length, dy / length];
+    });
+    const miters = edges.map((edge, index) => {
+        const previous = edges[(index + edges.length - 1) % edges.length];
+        const turn = previous[0] * edge[1] - previous[1] * edge[0];
+        if (!(turn > 1e-12))
+            fail("End treatments require a strictly convex counterclockwise contour without collinear vertices.");
+        const denominator = 1 + previous[0] * edge[0] + previous[1] * edge[1];
+        return [(-previous[1] - edge[1]) / denominator, (previous[0] + edge[0]) / denominator];
+    });
+    const magnification = miters.reduce((maximum, [x, y]) => Math.max(maximum, Math.hypot(x, y)), 1);
+    const sampling = {
+        resolution: options.resolution,
+        limits: options.limits,
+        magnification,
+    };
+    const bottom = options.ends.bottom, top = options.ends.top;
+    const bottomSize = bottom === undefined
+        ? [0, 0]
+        : edgeTreatmentSetbacks(bottom, "extrude", Math.PI / 2, options.limits);
+    const topSize = top === undefined ? [0, 0] : edgeTreatmentSetbacks(top, "extrude", Math.PI / 2, options.limits);
+    if (bottomSize[1] + topSize[1] >= options.height)
+        fail("End treatments must leave positive length between their side setbacks.");
+    const rowCount = (bottom === undefined ? 1 : edgeTreatmentPointCount(bottom, "extrude", sampling)) +
+        (top === undefined ? 1 : edgeTreatmentPointCount(top, "extrude", sampling));
+    assertSamplingCount(rowCount, "extrude", options.limits.maxPathPoints);
+    const vertexCount = rowCount * points.length, triangleCount = 2 * vertexCount - 4;
+    assertMeshAllocationWithinLimits(vertexCount, triangleCount, 12 * (vertexCount + triangleCount), "extrude", options.limits);
+    const bottomPoints = bottom === undefined ? [[0, 0]] : sampleEdgeTreatment(bottom, "extrude", sampling);
+    const topPoints = top === undefined ? [[0, 0]] : sampleEdgeTreatment(top, "extrude", sampling);
+    const rows = [
+        ...bottomPoints.map(([inset, depth]) => ({ inset, z: depth })),
+        ...[...topPoints].reverse().map(([inset, depth]) => ({ inset, z: options.height - depth })),
+    ];
+    const offset = (inset) => {
+        const result = points.map(([x, y], index) => [
+            x + miters[index][0] * inset,
+            y + miters[index][1] * inset,
+        ]);
+        for (let index = 0; index < result.length; index++) {
+            const point = result[index], next = result[(index + 1) % result.length], edge = edges[index];
+            if (!point.every(Number.isFinite) ||
+                !((next[0] - point[0]) * edge[0] + (next[1] - point[1]) * edge[1] > 0))
+                fail("End treatment inset collapses or reverses a contour edge.");
+        }
+        return result;
+    };
+    offset(Math.max(bottomSize[0], topSize[0])); // fit fails before allocating the full station family
+    const stations = rows.map(({ inset, z }) => ({
+        z: controls.center ? z - options.height / 2 : z,
+        profile: {
+            components: [{ ...profile.components[0], outer: { ...contour, points: offset(inset) } }],
+        },
+    }));
+    return buildProfileLoftMesh(module, stations, options.limits);
+}

package/dist/engine/finalization.js

@@ -0,0 +1,214 @@
+import { GeometryError } from "../geometry/errors.js";
+import { optimizePlanarPatches } from "../geometry/mesh-planar.js";
+import { analyzeTriangleMesh } from "../geometry/mesh.js";
+import { copiedMeshViews, copiedUint32Array } from "./native/copied-views.js";
+const isArray = (value) => Array.isArray(value);
+function finalPartTotals(parts) {
+    const buffers = new Set();
+    let vertices = 0, triangles = 0, bytes = 0, volumeMm3 = 0;
+    for (const part of parts) {
+        vertices += part.measurements.vertexCount;
+        triangles += part.measurements.triangleCount;
+        volumeMm3 += part.measurements.signedVolume;
+        for (const buffer of [part.positions.buffer, part.indices.buffer]) {
+            if (!buffers.has(buffer)) {
+                buffers.add(buffer);
+                bytes += buffer.byteLength;
+            }
+        }
+    }
+    return { vertices, triangles, bytes, volumeMm3 };
+}
+function fitsLimits(totals, limits) {
+    return (totals.vertices <= limits.maxVertices &&
+        totals.triangles <= limits.maxTriangles &&
+        totals.bytes <= limits.maxBytes);
+}
+/** Finalizes one complete build under the selected limits, preserving usable originals when optional cleanup fails. */
+export function finalizeModel(execution, output, limits, options, startedAt, builtAt) {
+    const descriptors = execution.isSolid(output) ? [{ id: "model", solid: output }] : output;
+    if (!isArray(descriptors) || descriptors.length === 0)
+        throw new GeometryError("INVALID_ARGUMENT", "Build must return a solid or at least one named part.", { operation: "finalize" });
+    if (descriptors.length > limits.maxParts)
+        throw new GeometryError("COMPLEXITY_LIMIT", `Output exceeds ${limits.maxParts} parts.`, {
+            operation: "finalize",
+        });
+    const ids = new Set();
+    const backingBuffers = new Set();
+    const meshCopies = new Map();
+    const min = [Infinity, Infinity, Infinity], max = [-Infinity, -Infinity, -Infinity];
+    let vertices = 0, triangles = 0, bytes = 0;
+    let parts = descriptors.map((descriptor) => {
+        if (typeof descriptor !== "object" ||
+            descriptor === null ||
+            typeof descriptor.id !== "string" ||
+            !/^[a-z0-9]+(?:-[a-z0-9]+)*$/.test(descriptor.id) ||
+            descriptor.id.length > 64 ||
+            ids.has(descriptor.id))
+            throw new GeometryError("INVALID_ARGUMENT", "Part IDs must be unique canonical lowercase identifiers of at most 64 characters.", { operation: "finalize" });
+        ids.add(descriptor.id);
+        if (descriptor.color !== undefined &&
+            (typeof descriptor.color !== "string" || !/^#[\da-f]{6}$/i.test(descriptor.color)))
+            throw new GeometryError("INVALID_ARGUMENT", "Part colors must be six-digit hex strings.", {
+                operation: "finalize",
+            });
+        if ((descriptor.solid === undefined) === (descriptor.mesh === undefined))
+            throw new GeometryError("INVALID_ARGUMENT", "Each part must contain exactly one solid or mesh.", { operation: "finalize" });
+        const nativeAnalysis = descriptor.solid === undefined ? undefined : execution.analyzedMeshFor(descriptor.solid);
+        const source = descriptor.solid === undefined ? descriptor.mesh : nativeAnalysis.mesh;
+        if (!(source.positions instanceof Float32Array) ||
+            !(source.indices instanceof Uint32Array) ||
+            !(source.positions.buffer instanceof ArrayBuffer) ||
+            !(source.indices.buffer instanceof ArrayBuffer))
+            throw new GeometryError("INVALID_MESH", "Parts require transferable Float32 positions and Uint32 indices.", { operation: "finalize" });
+        const sourceVertices = source.positions.length / 3, sourceTriangles = source.indices.length / 3;
+        let sourceBytes = 0;
+        for (const buffer of [source.positions.buffer, source.indices.buffer]) {
+            if (!backingBuffers.has(buffer)) {
+                backingBuffers.add(buffer);
+                sourceBytes += buffer.byteLength;
+            }
+        }
+        vertices += sourceVertices;
+        triangles += sourceTriangles;
+        bytes += sourceBytes;
+        if (vertices > limits.maxVertices || triangles > limits.maxTriangles || bytes > limits.maxBytes)
+            throw new GeometryError("COMPLEXITY_LIMIT", "Aggregate output exceeds the execution limits.", { operation: "finalize" });
+        // Direct meshes are copied before analysis so later caller mutation cannot invalidate facts.
+        const mesh = descriptor.mesh === undefined ? source : copiedMeshViews(source, meshCopies);
+        const measurements = nativeAnalysis?.measurements ??
+            analyzeTriangleMesh(mesh, { requireClosed: true, includeTopology: true });
+        if (descriptor.mesh !== undefined)
+            execution.validateMesh(mesh);
+        if (!(measurements.signedVolume > 0))
+            throw new GeometryError("INVALID_TOPOLOGY", "Manufacturing parts must enclose positive oriented volume.", { operation: "finalize" });
+        for (let axis = 0; axis < 3; axis += 1) {
+            min[axis] = Math.min(min[axis], measurements.bounds.min[axis]);
+            max[axis] = Math.max(max[axis], measurements.bounds.max[axis]);
+        }
+        return Object.freeze({
+            id: descriptor.id,
+            ...mesh,
+            ...(descriptor.color === undefined ? {} : { color: descriptor.color.toLowerCase() }),
+            measurements,
+        });
+    });
+    const originalParts = parts;
+    if (options.meshTopologyMode === "optimized" && triangles <= 200_000) {
+        const candidates = new Map();
+        parts = parts.map((part) => {
+            let indexBuffers = candidates.get(part.positions.buffer);
+            if (indexBuffers === undefined) {
+                indexBuffers = new Map();
+                candidates.set(part.positions.buffer, indexBuffers);
+            }
+            let views = indexBuffers.get(part.indices.buffer);
+            if (views === undefined) {
+                views = new Map();
+                indexBuffers.set(part.indices.buffer, views);
+            }
+            const key = `${part.positions.byteOffset}:${part.positions.length}:${part.indices.byteOffset}:${part.indices.length}`;
+            const cached = views.get(key);
+            if (cached !== undefined)
+                return Object.freeze({ ...part, ...cached });
+            let selected = {
+                positions: part.positions,
+                indices: part.indices,
+                measurements: part.measurements,
+            };
+            try {
+                const optimized = optimizePlanarPatches(part);
+                if (optimized.changed) {
+                    const mesh = {
+                        positions: part.positions,
+                        indices: copiedUint32Array(optimized.mesh.indices),
+                    };
+                    const measurements = analyzeTriangleMesh(mesh, {
+                        requireClosed: true,
+                        includeTopology: true,
+                    });
+                    execution.validateMesh(mesh);
+                    selected = { ...mesh, measurements };
+                }
+            }
+            catch {
+                // Optional optimization preserves the usable original on unsupported geometry.
+            }
+            views.set(key, selected);
+            return Object.freeze({ ...part, ...selected });
+        });
+    }
+    // Statistics describe the exact selected buffers after optional finalization.
+    let totals = finalPartTotals(parts);
+    if (!fitsLimits(totals, limits) && parts !== originalParts) {
+        parts = originalParts;
+        totals = finalPartTotals(parts);
+    }
+    if (!fitsLimits(totals, limits))
+        throw new GeometryError("COMPLEXITY_LIMIT", "Selected output exceeds the execution limits.", {
+            operation: "finalize",
+        });
+    const finalizedAt = performance.now();
+    return Object.freeze({
+        parts: Object.freeze(parts),
+        bounds: Object.freeze({ min: Object.freeze(min), max: Object.freeze(max) }),
+        stats: Object.freeze({
+            ...totals,
+            buildMs: builtAt - startedAt,
+            finalizationMs: finalizedAt - builtAt,
+            generationMs: finalizedAt - startedAt,
+        }),
+    });
+}
+/** Captures mutable external buffers once before an asynchronous snapshot export begins. */
+export function captureExportParts(parts, limits) {
+    if (!isArray(parts) || parts.length === 0 || parts.length > limits.maxParts)
+        throw new GeometryError("COMPLEXITY_LIMIT", `Export requires one through ${limits.maxParts} parts.`, {
+            operation: "export3mf",
+        });
+    const identifiers = new Set();
+    const buffers = new Set();
+    let vertexCount = 0, triangleCount = 0, byteCount = 0;
+    for (const part of parts) {
+        if (typeof part !== "object" ||
+            part === null ||
+            typeof part.id !== "string" ||
+            !/^[a-z0-9]+(?:-[a-z0-9]+)*$/.test(part.id) ||
+            part.id.length > 64 ||
+            identifiers.has(part.id))
+            throw new GeometryError("INVALID_ARGUMENT", "Export part IDs must be unique canonical identifiers.", { operation: "export3mf" });
+        identifiers.add(part.id);
+        if (part.color !== undefined &&
+            (typeof part.color !== "string" || !/^#[\da-f]{6}$/i.test(part.color)))
+            throw new GeometryError("INVALID_ARGUMENT", "Export colors must be six-digit hex strings.", {
+                operation: "export3mf",
+            });
+        if (!(part.positions instanceof Float32Array) ||
+            !(part.indices instanceof Uint32Array) ||
+            !(part.positions.buffer instanceof ArrayBuffer) ||
+            !(part.indices.buffer instanceof ArrayBuffer))
+            throw new GeometryError("INVALID_MESH", "Export requires transferable copied mesh arrays.", {
+                operation: "export3mf",
+            });
+        vertexCount += part.positions.length / 3;
+        triangleCount += part.indices.length / 3;
+        for (const buffer of [part.positions.buffer, part.indices.buffer]) {
+            if (!buffers.has(buffer)) {
+                buffers.add(buffer);
+                byteCount += buffer.byteLength;
+            }
+        }
+        if (vertexCount > limits.maxVertices ||
+            triangleCount > limits.maxTriangles ||
+            byteCount > limits.maxBytes)
+            throw new GeometryError("COMPLEXITY_LIMIT", "Export snapshot exceeds the execution limits.", {
+                operation: "export3mf",
+            });
+    }
+    const copiedBuffers = new Map();
+    return parts.map((part) => ({
+        id: part.id,
+        ...copiedMeshViews(part, copiedBuffers),
+        ...(part.color === undefined ? {} : { color: part.color }),
+    }));
+}

package/dist/engine/index.js

@@ -0,0 +1,72 @@
+import { GeometryError } from "../geometry/errors.js";
+import { defaultModelingLimits, resolveModelingLimits } from "../geometry/model-limits.js";
+import { bindModelContext } from "../model/execution-binding.js";
+import { createExecutionContext } from "./execution.js";
+import { captureExportParts, finalizeModel } from "./finalization.js";
+import createManifoldModule from "./kernel/manifold.js";
+import { withManifoldScope } from "./native/context.js";
+import { assertSynchronousScopeResult } from "./native/ownership.js";
+export { defaultModelingLimits };
+/** URL of the package's pinned WASM asset; browser bundlers may replace it with their emitted URL. */
+export const modelingWasmUrl = new URL("./kernel/manifold.wasm", import.meta.url).href;
+/** Creates an engine over one already initialized host kernel.
+ * Kept internal to host integration tests; ordinary consumers use createModelEngine.
+ * @internal
+ */
+function engineFromModule(module, engineLimits) {
+    let building = false;
+    return Object.freeze({
+        limits: engineLimits,
+        async export3mf(parts, options = {}) {
+            if (building)
+                throw new GeometryError("INVALID_ARGUMENT", "An engine cannot export during another operation.", { operation: "export3mf" });
+            const snapshot = captureExportParts(parts, engineLimits);
+            const snapshotOptions = { ...options };
+            building = true;
+            try {
+                const { meshesTo3mf } = await import("./export-3mf.js");
+                return meshesTo3mf(snapshot, snapshotOptions);
+            }
+            finally {
+                building = false;
+            }
+        },
+        build(build, options = {}) {
+            if (building)
+                throw new GeometryError("INVALID_ARGUMENT", "An engine cannot run nested builds.", {
+                    operation: "build",
+                });
+            const limits = resolveModelingLimits(options.limits, engineLimits);
+            building = true;
+            const startedAt = performance.now();
+            try {
+                return withManifoldScope(module, (scope) => {
+                    const execution = createExecutionContext(module, scope, limits, options.resolution);
+                    try {
+                        const output = bindModelContext(execution.context, () => build(execution.context));
+                        assertSynchronousScopeResult(output, () => new GeometryError("INVALID_ARGUMENT", "Build callbacks must be synchronous.", {
+                            operation: "build",
+                        }));
+                        const builtAt = performance.now();
+                        return finalizeModel(execution, output, limits, options, startedAt, builtAt);
+                    }
+                    finally {
+                        execution.dispose();
+                    }
+                });
+            }
+            finally {
+                building = false;
+            }
+        },
+    });
+}
+/** Initializes one host kernel and returns a lifecycle-safe engine. No generator initializes WASM. */
+export async function createModelEngine(options = {}) {
+    const limits = resolveModelingLimits(options.limits);
+    const module = await createManifoldModule({
+        locateFile: options.locateFile ?? (() => modelingWasmUrl),
+    });
+    module.setup();
+    return engineFromModule(module, limits);
+}

package/dist/engine/inspection-operations.js

@@ -0,0 +1,52 @@
+import { ownScopedManifoldValue } from "./native/context.js";
+import { copiedMeshViews } from "./native/copied-views.js";
+/** Internal host-bound inspection operations. */
+export function createInspectionOperations(environment) {
+    const { scope, throwGeometryError, nativeSolid, nativeSection, ownSolid, validateFiniteNumber, requirePositiveNumber, validateCoordinates, analyzedMeshFor, } = environment;
+    const operations = {
+        toTriangleMesh: (value) => copiedMeshViews(analyzedMeshFor(value).mesh, new Map()),
+        inspectSection: (handle) => {
+            const native = nativeSection(handle), bounds = native.bounds();
+            const parts = native.decompose().map((part) => ownScopedManifoldValue(scope, part));
+            return {
+                ...bounds,
+                area: native.area(),
+                contours: native.toPolygons().length,
+                parts: parts.length,
+                vertices: native.numVert(),
+            };
+        },
+        inspectSolid: (handle) => {
+            const native = nativeSolid(handle), bounds = native.boundingBox();
+            const parts = native.decompose().map((part) => ownScopedManifoldValue(scope, part));
+            return { ...bounds, parts: parts.length, volume: native.volume() };
+        },
+        rayCast: (handle, origin, endpoint) => {
+            validateCoordinates(origin, 3, "rayCast");
+            validateCoordinates(endpoint, 3, "rayCast");
+            const segmentLength = Math.hypot(...origin.map((value, axis) => value - endpoint[axis]));
+            if (!Number.isFinite(segmentLength) || segmentLength === 0)
+                throwGeometryError("DEGENERATE_GEOMETRY", "rayCast", "Ray segment endpoints must differ.");
+            return Object.freeze(nativeSolid(handle)
+                .rayCast([...origin], [...endpoint])
+                .map((hit) => Object.freeze({
+                faceId: Number(hit.faceID),
+                distance: hit.distance * segmentLength,
+                position: Object.freeze([...hit.position]),
+                normal: Object.freeze([...hit.normal]),
+            })));
+        },
+        components: (handle) => nativeSolid(handle).decompose().map(ownSolid),
+        simplify: (handle, tolerance) => {
+            const native = nativeSolid(handle);
+            const original = ownScopedManifoldValue(scope, native.asOriginal());
+            return ownSolid(original.simplify(requirePositiveNumber(tolerance, "simplify")));
+        },
+        setTolerance: (handle, tolerance) => {
+            if (validateFiniteNumber(tolerance, "setTolerance") < 0)
+                throwGeometryError("INVALID_ARGUMENT", "setTolerance", "Tolerance must be nonnegative millimetres.");
+            return ownSolid(nativeSolid(handle).setTolerance(tolerance));
+        },
+    };
+    return operations;
+}

package/dist/engine/kernel/LICENSE

@@ -0,0 +1,201 @@
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright [yyyy] [name of copyright owner]
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.