@atlassian/chippy 0.0.0-stage → 0.0.1-beta.2

package/lib/extension/panel-dom.js

@@ -0,0 +1,90 @@
+/* eslint-disable */
+(function installChippyPanelDom(global) {
+  function nodeKey(node) {
+    return node?.nodeType === 1 ? node.getAttribute('data-chippy-key') : null;
+  }
+
+  function canPatch(current, next) {
+    if (!current || !next || current.nodeType !== next.nodeType) return false;
+    if (current.nodeType === 1 && current.tagName !== next.tagName) return false;
+    const currentKey = nodeKey(current);
+    const nextKey = nodeKey(next);
+    return currentKey || nextKey ? currentKey === nextKey : true;
+  }
+
+  function syncAttributes(current, next) {
+    Array.from(current.attributes).forEach((attribute) => {
+      if (!next.hasAttribute(attribute.name)) current.removeAttribute(attribute.name);
+    });
+    Array.from(next.attributes).forEach((attribute) => {
+      if (current.getAttribute(attribute.name) !== attribute.value) {
+        current.setAttribute(attribute.name, attribute.value);
+      }
+    });
+  }
+
+  function patchNode(current, next) {
+    if (current.nodeType === 3 || current.nodeType === 8) {
+      if (current.data !== next.data) current.data = next.data;
+      return;
+    }
+    if (current.nodeType !== 1) return;
+
+    const tagName = current.tagName;
+    const preservesValue = tagName === 'INPUT' || tagName === 'TEXTAREA' || tagName === 'SELECT';
+    const value = preservesValue ? current.value : null;
+    const checked = tagName === 'INPUT' ? current.checked : null;
+
+    syncAttributes(current, next);
+    patchChildNodes(current, next);
+
+    // Probe annotations are drafts until Attach is clicked. Rendering new
+    // runtime evidence must not overwrite an in-progress value.
+    if (preservesValue) current.value = value;
+    if (tagName === 'INPUT') current.checked = checked;
+  }
+
+  function patchChildNodes(currentParent, nextParent) {
+    const currentChildren = Array.from(currentParent.childNodes);
+    const keyed = new Map(
+      currentChildren
+        .map((node) => [nodeKey(node), node])
+        .filter(([key]) => Boolean(key)),
+    );
+    const used = new Set();
+    let cursor = currentParent.firstChild;
+
+    Array.from(nextParent.childNodes).forEach((nextChild) => {
+      const key = nodeKey(nextChild);
+      let current = key ? keyed.get(key) : null;
+
+      while (cursor && used.has(cursor)) cursor = cursor.nextSibling;
+      if (!current && cursor && !nodeKey(cursor) && canPatch(cursor, nextChild)) current = cursor;
+
+      if (current && canPatch(current, nextChild)) {
+        if (current !== cursor) currentParent.insertBefore(current, cursor);
+        patchNode(current, nextChild);
+      } else {
+        current = nextChild.cloneNode(true);
+        currentParent.insertBefore(current, cursor);
+      }
+
+      used.add(current);
+      cursor = current.nextSibling;
+    });
+
+    Array.from(currentParent.childNodes).forEach((child) => {
+      if (used.has(child)) return;
+      if (child.nodeType === 1 && child.hasAttribute('data-chippy-preserve')) return;
+      child.remove();
+    });
+  }
+
+  function patchChildren(target, html) {
+    const template = target.ownerDocument.createElement('template');
+    template.innerHTML = html;
+    patchChildNodes(target, template.content);
+  }
+
+  global.__CHIPPY_PANEL_DOM__ = { patchChildren };
+})(window);

package/lib/extension/resolve-probes.js

@@ -0,0 +1,342 @@
+/* eslint-disable */
+(function installResolveProbes(global) {
+  const chippy = global.__CHIPPY = global.__CHIPPY || {};
+  // Always reinstall — guards caused stale code to win after extension reload.
+
+  // ─── Source confidence ────────────────────────────────────────────────────
+  // In a dev build React <=18 exposes _debugSource; React 19 exposes
+  // _debugStack, which the bundled resolver turns into a source location.
+  // In a production build neither exists — we only have component function
+  // names from fiber.type, which may also be minified.
+  //
+  // Every resolved probe carries a `confidence` field:
+  //   "dev"         — React development source evidence is present
+  //   "production"  — no _debugSource, component names only (may be minified)
+  //   "unknown"     — could not determine anything useful
+
+  function sourceConfidence(source, owners) {
+    if (source?.fileName) return 'dev';
+    if (owners?.some((o) => o?.source?.fileName)) return 'dev';
+    return 'production';
+  }
+
+  function summarizeSource(source) {
+    if (!source) return null;
+    return {
+      fileName: source.fileName || null,
+      lineNumber: source.lineNumber || null,
+      columnNumber: source.columnNumber || null,
+    };
+  }
+
+  function summarizeChainEntry(entry) {
+    if (!entry) return null;
+    return {
+      name: entry.name || null,
+      key: entry.key ?? null,
+      source: summarizeSource(entry.source),
+      // props from layout-lab getOwnerChain/getReturnComponentChain are already key arrays
+      propNames: Array.isArray(entry.props)
+        ? entry.props.filter((k) => k !== 'children')
+        : (entry.props && typeof entry.props === 'object' ? listPropNames(entry.props) : []),
+      hookCount: entry.hookCount ?? null,
+      hookCountTruncated: entry.hookCountTruncated ?? false,
+      hookCountMax: entry.hookCountMax ?? null,
+      complexityNote: typeof entry.hookCount === 'number' && entry.hookCount >= 40
+        ? 'High enough hook count to inspect carefully before changing local logic.'
+        : null,
+    };
+  }
+
+  function summarizeProps(props) {
+    if (!props || typeof props !== 'object') return {};
+    return Object.entries(props)
+      .filter(([k]) => !['children', 'style', 'className'].includes(k))
+      .reduce((acc, [k, v]) => {
+        if (v == null) { acc[k] = v; return acc; }
+        if (typeof v === 'string' || typeof v === 'number' || typeof v === 'boolean') {
+          acc[k] = v; return acc;
+        }
+        if (Array.isArray(v)) { acc[k] = `[array:${v.length}]`; return acc; }
+        if (typeof v === 'function') { acc[k] = '[function]'; return acc; }
+        acc[k] = v?.id || v?.key || v?.name || '[object]';
+        return acc;
+      }, {});
+  }
+
+  // List all prop names (excluding children) for a props object — used for compact snapshot
+  function listPropNames(props) {
+    if (!props || typeof props !== 'object') return [];
+    return Object.keys(props).filter((k) => k !== 'children');
+  }
+
+  // ─── Component stack fallback for production ──────────────────────────────
+  // When _debugSource is absent we still try to provide a useful component
+  // stack by walking fiber.return. Names may be minified in production.
+
+  function getComponentStack(fiber) {
+    if (!fiber) return [];
+    const stack = [];
+    let current = fiber.return;
+    while (current) {
+      const name =
+        current.type?.displayName ||
+        current.type?.name ||
+        current.type?.render?.displayName ||
+        current.type?.render?.name ||
+        null;
+      if (name && typeof current.type !== 'string') {
+        stack.push({ name, key: current.key ?? null, source: null });
+      }
+      current = current.return;
+    }
+    return stack;
+  }
+
+  // ─── Full probe summary ───────────────────────────────────────────────────
+
+  function summarizeProbe(probe) {
+    const best = probe?.probe?.best;
+    return {
+      dom: {
+        tag: best?.exact?.domTag,
+        text: best?.exact?.domText,
+        fiberType: best?.exact?.fiberType,
+        source: best?.exact?.source,
+      },
+      component: {
+        name: best?.component?.name,
+        key: best?.component?.key ?? null,
+        props: best?.component?.props,
+        propNames: listPropNames(best?.component?.props),
+        hookCount: best?.component?.hookCount ?? null,
+        hookCountTruncated: best?.component?.hookCountTruncated ?? false,
+        hookCountMax: best?.component?.hookCountMax ?? null,
+        complexityNote: typeof best?.component?.hookCount === 'number' && best.component.hookCount >= 40
+          ? 'High enough hook count to inspect carefully before changing local logic.'
+          : null,
+        source: best?.component?.source,
+        owners: best?.component?.owners,
+        parents: best?.component?.parents,
+      },
+    };
+  }
+
+  // ─── Compact probe summary (used by bridge for publishing) ────────────────
+
+  function compactProbeSummary(probe) {
+    const best = probe?.probe?.best;
+
+    const componentSource = summarizeSource(best?.component?.source);
+    const owners = (best?.component?.owners || []).map(summarizeChainEntry);
+    const confidence = sourceConfidence(componentSource, owners);
+
+    // In production, owners from _debugOwner chain are absent.
+    // Fall back to the fiber return-chain component stack.
+    let resolvedOwners = owners;
+    let componentStack = null;
+    if (confidence === 'production') {
+      // Try to get the raw fiber for fallback stack
+      const rawFiber = probe?.probe?.rawFiber || null;
+      componentStack = getComponentStack(rawFiber);
+    }
+
+    // Matched CSS rules — rules from all sheets whose selector matches the target element
+    const targetEl = probe?.probe?._targetEl || null;
+    const inspectedTarget = targetEl ? chippy.inspectReact?.inspectNode?.(targetEl) : null;
+    const nearestTestId = inspectedTarget?.nearestTestIdParent?.testId || null;
+    const matchedStyles = [];
+    if (targetEl) {
+      try {
+        for (const sheet of document.styleSheets) {
+          let rules;
+          try { rules = sheet.cssRules; } catch { continue; }
+          for (const rule of rules) {
+            if (rule instanceof CSSStyleRule) {
+              try {
+                if (targetEl.matches(rule.selectorText)) {
+                  matchedStyles.push({
+                    selector: rule.selectorText,
+                    declarations: rule.style.cssText,
+                    source: sheet.href || 'inline',
+                  });
+                }
+              } catch { /* invalid selector — skip */ }
+            }
+          }
+        }
+      } catch { /* sheet access failed */ }
+    }
+
+    // DOM parent chain — walk up to 10 parentElement levels from the target element
+    const domParents = [];
+    if (targetEl) {
+      let el = targetEl.parentElement;
+      while (el && domParents.length < 10) {
+        const cls = el.className && typeof el.className === 'string'
+          ? el.className.trim().split(/\s+/).slice(0, 3).join(' ')
+          : null;
+        domParents.push({
+          tag: el.tagName?.toLowerCase() || null,
+          id: el.id || null,
+          className: cls || null,
+        });
+        el = el.parentElement;
+      }
+    }
+
+    return {
+      nearestTestId,
+      confidence,
+      dom: {
+        tag: best?.exact?.domTag || null,
+        text: (best?.exact?.domText || '').slice(0, 80),
+        fiberType: best?.exact?.fiberType || null,
+        source: summarizeSource(best?.exact?.source),
+        parents: domParents,
+        matchedStyles,
+      },
+      component: {
+        name: best?.component?.name || null,
+        key: best?.component?.key ?? null,
+        propNames: listPropNames(best?.component?.props),
+        props: summarizeProps(best?.component?.props),
+        hookCount: best?.component?.hookCount ?? null,
+        hookCountTruncated: best?.component?.hookCountTruncated ?? false,
+        hookCountMax: best?.component?.hookCountMax ?? null,
+        complexityNote: typeof best?.component?.hookCount === 'number' && best.component.hookCount >= 40
+          ? 'High enough hook count to inspect carefully before changing local logic.'
+          : null,
+        source: componentSource,
+        owners: resolvedOwners,
+        // In production: source-free stack from fiber.return walk
+        componentStack: confidence !== 'dev' ? componentStack : null,
+        parents: (best?.component?.parents || []).map(summarizeChainEntry),
+      },
+      // Human-readable note about what is and isn't available
+      note: confidence === 'dev'
+        ? null
+        : confidence === 'production'
+          ? 'Production build: no React development source metadata is available. Component names may be minified. Source locations are not reliable. Use component stack and names only.'
+          : 'Could not determine build mode. Probe data may be incomplete.',
+    };
+  }
+
+  // ─── Cross-source correlation hint ───────────────────────────────────────
+  // When one probe is on a dev page and another is on a production page
+  // pointing at "around the same component", the agent can use this to
+  // try to match names across the two.
+
+
+  function componentIdentity(entry) {
+    if (!entry) return null;
+    const src = entry.source || null;
+    const srcKey = src && src.fileName ? `${src.fileName}:${src.lineNumber || 0}:${src.columnNumber || 0}` : '';
+    return `${entry.name || ''}|${entry.key ?? ''}|${srcKey}`;
+  }
+
+  function ancestryForSummary(summary) {
+    if (!summary?.component) return [];
+    const out = [];
+    out.push({
+      name: summary.component.name || null,
+      key: summary.component.key ?? null,
+      source: summary.component.source || null,
+      propNames: summary.component.propNames || [],
+      hookCount: summary.component.hookCount ?? null,
+      hookCountTruncated: summary.component.hookCountTruncated ?? false,
+      hookCountMax: summary.component.hookCountMax ?? null,
+      complexityNote: summary.component.complexityNote || null,
+    });
+    for (const parent of summary.component.parents || []) out.push(parent);
+    return out.filter(Boolean);
+  }
+
+  function findCommonParent(summaries) {
+    const ids = Object.keys(summaries).filter((id) => !id.startsWith('__') && summaries[id]?.component);
+    if (ids.length < 2) return null;
+    const chains = ids.map((id) => ancestryForSummary(summaries[id]));
+    if (chains.some((c) => c.length === 0)) return null;
+    const otherSets = chains.slice(1).map((chain) => new Set(chain.map(componentIdentity).filter(Boolean)));
+    for (const entry of chains[0]) {
+      const id = componentIdentity(entry);
+      if (!id) continue;
+      if (otherSets.every((set) => set.has(id))) {
+        return {
+          confidence: 'dev',
+          dom: null,
+          component: {
+            name: entry.name || null,
+            key: entry.key ?? null,
+            propNames: entry.propNames || [],
+            props: {},
+            hookCount: entry.hookCount ?? null,
+            hookCountTruncated: entry.hookCountTruncated ?? false,
+            hookCountMax: entry.hookCountMax ?? null,
+            complexityNote: entry.complexityNote || null,
+            source: entry.source || null,
+            owners: [],
+            componentStack: null,
+            parents: [],
+          },
+          note: `Nearest common parent for probes ${ids.join(', ')}.`,
+        };
+      }
+    }
+    return null;
+  }
+
+  function correlatePairs(summaries) {
+    const ids = Object.keys(summaries);
+    const devProbes = ids.filter((id) => summaries[id]?.confidence === 'dev');
+    const prodProbes = ids.filter((id) => summaries[id]?.confidence === 'production');
+    if (devProbes.length === 0 || prodProbes.length === 0) return null;
+
+    const hints = [];
+    for (const devId of devProbes) {
+      for (const prodId of prodProbes) {
+        const devName = summaries[devId]?.component?.name;
+        const prodName = summaries[prodId]?.component?.name;
+        hints.push({
+          devProbe: devId,
+          productionProbe: prodId,
+          devComponentName: devName || null,
+          productionComponentName: prodName || null,
+          note: devName && prodName && devName === prodName
+            ? `Component names match ("${devName}") — likely the same component.`
+            : devName && prodName
+              ? `Component names differ ("${devName}" vs "${prodName}") — may still be the same component if production is minified. Check component stack for structural similarity.`
+              : 'Could not compare — one or both probes have no component name.',
+        });
+      }
+    }
+    return hints.length > 0 ? hints : null;
+  }
+
+  // ─── Public API ───────────────────────────────────────────────────────────
+
+  function resolveProbes(...ids) {
+    const result = {};
+    for (const id of ids) {
+      const probe = chippy.layoutLab?.getMarkerProbe(id);
+      result[id] = probe ? summarizeProbe(probe) : null;
+    }
+    return result;
+  }
+
+  function resolveProbesCompact(...ids) {
+    const result = {};
+    for (const id of ids) {
+      const probe = chippy.layoutLab?.getMarkerProbe(id);
+      result[id] = probe ? compactProbeSummary(probe) : null;
+    }
+    const crossSourceHints = correlatePairs(result);
+    if (crossSourceHints) result.__crossSourceHints = crossSourceHints;
+    const commonParent = findCommonParent(result);
+    if (commonParent) result.__commonParent = commonParent;
+    return result;
+  }
+
+  chippy.resolveProbes = resolveProbes;
+  chippy.resolveProbesCompact = resolveProbesCompact;
+})(window);

package/lib/mcp-skill/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 (c) 2026 Atlassian US., Inc.
+
+   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.