extension-querying-oql
Получить данные проекта через OQL
Что получите
Подходящие записи или сводные показатели из данных проекта, возвращённые в формате Candid.
Что передать
Вопрос о данных, фильтры, нужные поля и выбор черновой или опубликованной версии проекта.
Проверен состав файлов. Запуск не тестировался. Что проверено
Оценки пользователей
Как использовать
Помогает агенту Caffeine Data Intelligence отвечать на вопросы о данных проекта через OQL. Подходит для поиска записей, сортировки, подсчётов, группировки и получения сведений из связанных сущностей.
- Сначала получите схему данных проекта, чтобы использовать реальные названия сущностей, полей и связей.
- Уточните, какие записи или итоговые показатели нужны, и задайте фильтры, порядок и ограничение количества строк.
- Выполните запрос и прочитайте результат; если он неполный, получите следующие страницы.
Условия работы
- Скилл рассчитан на среду Caffeine с уже установленным и настроенным icp CLI и компонентом backend, поддерживающим OQL.
- Запросы предназначены только для чтения. По умолчанию читается черновик; параметр --branch live выбирает опубликованную версию.
- Количество строк нужно ограничивать явно и проверять полноту ответа: автор компонента может установить собственный предел выдачи.
Пример запроса после установки
Найди в опубликованной версии проекта пять клиентов корпоративного тарифа с наибольшей месячной выручкой и покажи название компании, выручку и ответственного менеджера.
Пример составлен по инструкции автора; результат запуска не проверялся.
Основание: инструкция закреплённой версииДля установки
Node.js, npm и Git для команды выше. Подключения и инструменты для работы скилла настраиваются отдельно.
Совместимые агенты
Совместимость указана для инструкций. Запуск в каждом приложении не тестировался; для веб-чата способ подключения может отличаться.
Файлы скилла
GitHubЧитать инструкцию SKILL.md
Исходный текст закреплённой версии.
---
name: extension-querying-oql
description: >-
Quick reference for the Caffeine Data Intelligence agent to query an
OQL-exposing canister (schema() + execute()) through the `icp` CLI
against the project's `backend` canister: read the schema, form JSON
queries (filter / order / paginate / aggregate / dotted-path edges),
and parse the Candid result rows.
version: 0.8.0
compatibility:
mops: {}
npm: {}
caffeineai-subscription: [none]
---
# Querying OQL — quick reference
An OQL canister exposes two read-only methods:
| Method | Returns | Purpose |
|---|---|---|
| `schema()` | one JSON `Text` | Catalogue of the canister's entities: each entity's primary key, fields, and edges. |
| `execute(qJson : text)` | typed Candid `Result` | Runs a JSON-encoded query and returns matching rows. |
## Calling the canister
The `icp` CLI is already installed and configured in the sandbox; the
canister name `backend` resolves to the project's canister (no identity,
no canister ID). Both methods are `query` calls, so every invocation
uses `--query`:
```bash
icp canister call backend schema '()' --query
icp canister call backend execute '("<json-query>")' --query
```
`execute` takes one `text` argument — the JSON query embedded as a
Candid text literal. Wrap the JSON in `("...")` and escape every `"` as
`\"`. The query `{"start":"customer","limit":3}` becomes:
```bash
icp canister call backend execute '("{\"start\":\"customer\",\"limit\":3}")' --query
```
`schema()` returns its JSON the same way — a Candid `text` literal
`("...escaped json...")`; unescape `\"` → `"` (and `\\` → `\`) to read
it. Add `--branch live` to read the deployed canister instead of the
draft (live is query-only). If a string value contains a single quote,
escape it for the shell with `'\''`.
---
## Recipe
1. **Get the schema once.** `icp canister call backend schema '()' --query` — cache it for the session; it changes only between deployments (§1).
2. **Map the request to entities.** Pick the entity that holds the answer. Use each field's `typeName` and `values` to choose literal types, and `role: {"edge": ...}` to see how entities connect.
3. **Translate into one or more queries.** Start from the entity whose rows you want (§2). Add `where` (§2.1), `orderBy` / `limit` / `offset`, `select`, and `aggregate` / `groupBy` (§2.2). Cross a forward edge with a dotted path in a single query (§4.1); a reverse one-to-many needs the parent keys first, then `in` (§4.2).
4. **Run and read.** `icp canister call backend execute '("<json>")' --query` — parse the Candid rows by cell `name` (§3); if `hasMore`, page with `offset` (§5).
5. **Retry on traps.** There is no error envelope — re-read the schema, fix the query, rerun (§6).
---
## 1. Discover — `schema`
Fetch once and cache for the session — it only changes between canister
deployments.
```bash
icp canister call backend schema '()' --query
```
Read it like this:
- **`name`** → entity name; use it as `start` in queries.
- **`primaryKey`** → field whose value identifies a row. An edge
`{"to": "<entity>"}` value is a primary-key value in that target.
- **`fields`** → each field's `name`, scalar `typeName`, and `role`:
`"payload"` (plain field) or `{"edge": {"to": "<entity>"}}` (a foreign
key — how you traverse the graph). Names may carry a `__1`, `__2`, …
suffix when two columns would share a name — use the exact names
`schema()` reports.
- **`values`** (optional) → the exact literals a field can hold
(typically a variant's arms). Filter with those literals, not guesses:
`["free","pro","enterprise"]` means query `"enterprise"`, not
`"Enterprise"`. Absent ⇒ unbounded — sample it with a query if you
need candidates.
- **`typeName`** → JSON literal type for `value`:
- `"Nat"` → unsigned integer (`0`, `1`, …)
- `"Int"` → signed integer (`-1`, `0`, `1`, …)
- `"Float"` → JSON number with a decimal point (`0.5`, `-3.14`,
`1.0e2`). A bare integer (`10`) is also accepted — numeric variants
bridge, so `gt(price, 10)` matches a `price : Float = 12.5` row.
Float equality is bitwise IEEE-754; use a range (`ge` + `le`) for
decimals like `0.42` with no exact binary form.
- `"Bool"` → `true` / `false`
- `"Null"` → every sampled value was `null`; the real type is unknown
- `"Text"` → JSON string. `Principal` fields report as `"Text"`
(canonical textual form) — filter them with a string value.
---
## 2. Form a query — `execute`
A query is a single JSON object. Only `start` is required.
```json
{
"start": "<entityName>",
"where": <Predicate>,
"groupBy": ["<fieldName>", ...],
"aggregate": [{ "fn": "count|sum|avg|min|max", "field": "<fieldName>", "as": "<outName>" }, ...],
"orderBy": [{ "field": "<fieldName>", "dir": "asc|desc" }, ...],
"offset": <Nat>,
"limit": <Nat>,
"select": ["<fieldName>", ...]
}
```
| Field | Default | Notes |
|---|---|---|
| `start` | (required) | An entity `name` from `schema()`. |
| `where` | omit ⇒ no filter | A single predicate (§2.1) — **not** wrapped in `{"filter": ...}`. |
| `groupBy` | `[]` | Bucket rows by these fields; one output row per distinct combination (§2.2). |
| `aggregate` | `[]` | Aggregates per bucket, or over all rows when `groupBy` is empty (§2.2). |
| `orderBy` | `[]` (canister-defined order, typically insertion order) | Multi-key sort, first clause primary. `dir` defaults `"asc"`. |
| `offset` | `0` | Drop the first N matches. |
| `limit` | every match | Keep at most N. `hasMore` in the result tells you if more exist. |
| `select` | every non-hidden field (or, when aggregating, group-key + aggregate columns) | Subset projection. |
```bash
icp canister call backend execute '("{\"start\":\"customer\",\"limit\":3}")' --query
```
Filter + sort + project — the core shape (`where` + `orderBy` + `limit` + `select`):
```bash
icp canister call backend execute '("{\"start\":\"customer\",\"where\":{\"eq\":{\"field\":\"plan\",\"value\":\"enterprise\"}},\"orderBy\":[{\"field\":\"monthlyRevenueUsd\",\"dir\":\"desc\"}],\"limit\":5,\"select\":[\"companyName\",\"monthlyRevenueUsd\",\"accountManagerName\"]}")' --query
```
### 2.1 Predicate operators
A `Predicate` is a JSON object with **exactly one key** that names the
operator.
| Operator | Shape | Meaning |
|---|---|---|
| `eq` / `ne` / `lt` / `le` / `gt` / `ge` | `{"<op>": { "field": "<name>", "value": <scalar> } }` | Scalar relation. |
| `in` | `{"in": { "field": "<name>", "value": [<scalar>, ...] } }` | Membership; empty array matches nothing. |
| `contains` / `startsWith` / `endsWith` | `{"<op>": { "field": "<name>", "value": "<text>" } }` | Case-sensitive substring / prefix / suffix on `Text` — server-side scan, no need to page rows into context. |
| `icontains` | `{"icontains": { "field": "<name>", "value": "<text>" } }` | Case-insensitive `contains`. Prefer this for user-typed search terms. |
| `and` / `or` / `not` | `{"and": [<P>, ...]}` / `{"or": [<P>, ...]}` / `{"not": <P>}` | Boolean composition. |
Text search runs server-side — "the customer whose name mentions north" is one query, not a row scan into context:
```bash
icp canister call backend execute '("{\"start\":\"customer\",\"where\":{\"icontains\":{\"field\":\"companyName\",\"value\":\"north\"}},\"select\":[\"companyName\",\"accountManagerName\"]}")' --query
```
`<scalar>` must match the field's `typeName`:
| JSON | Maps to | Use for fields with typeName |
|---|---|---|
| `null` | `null_` | any field — `eq null` finds rows where an optional field is empty, `ne null` where it is set |
| `true` / `false` | `bool` | `"Bool"` |
| `0`, `1`, `42` | `nat` | `"Nat"` (also matches `"Float"` via numeric bridging) |
| `-1`, `-42` | `int` | `"Int"` (also matches `"Float"` via numeric bridging) |
| `0.5`, `-3.14`, `1.0e2` | `float` | `"Float"` |
| `"foo"` | `text` | `"Text"` |
A row whose field is `null_` fails every relation **except** `ne` and
`eq null`. Filter
by relationship with `field` = `"<edge>"` and `value` = the target
entity's **primary-key value**; or read *through* an edge with
`"<edge>.<targetField>"` (§4.1).
### 2.2 Aggregate — count, groupBy, sum/avg/min/max
Compute on the canister instead of fetching every row and tallying
client-side. `fn` is `count`/`sum`/`avg`/`min`/`max`; `field` is required
for every fn except `count`; `min`/`max` also work on text. `as` renames
the output column (default `count`, `sum_<field>`, …) and must not
contain `.` (dots are the edge-traversal separator — parse error). For a
dotted `field` the default joins segments with `_` (`sum` of
`dept.budget` → `sum_dept_budget`). `aggregate` with no `groupBy` → one
row over the whole filtered set (`count` of an empty match is `0`).
`groupBy` with no `aggregate` → a server-side DISTINCT. Output rows
contain only the group-key + aggregate columns.
"How many enterprise customers?" — `count` over a filtered set, one row out:
```bash
icp canister call backend execute '("{\"start\":\"customer\",\"where\":{\"eq\":{\"field\":\"plan\",\"value\":\"enterprise\"}},\"aggregate\":[{\"fn\":\"count\"}]}")' --query
```
"Which account manager has the most customers, and total MRR?" — `groupBy` + `count` + `sum`:
```bash
icp canister call backend execute '("{\"start\":\"customer\",\"groupBy\":[\"accountManager\"],\"aggregate\":[{\"fn\":\"count\"},{\"fn\":\"sum\",\"field\":\"monthlyRevenueUsd\",\"as\":\"mrr\"}],\"orderBy\":[{\"field\":\"count\",\"dir\":\"desc\"}],\"limit\":1}")' --query
```
---
## 3. Read the result
```candid
type Value = variant { null_; bool : bool; nat : nat; int : int; float : float; text : text };
type Cell = record { name : text; value : Value };
type Result = record { rows : vec vec Cell; hasMore : bool };
```
The outer `rows = vec { ... }` is the row list; each inner `vec { ... }`
is one row. Each `record { value = variant { "<tag>" = <payload> }; name = "<field>" }`
is one cell — `name` tells you which field, the `<tag>` tells you the
scalar type, the payload is the value. `35_000 : nat` underscores are
digit separators — strip them if parsing. `hasMore = false` ⇒ you got
every match; `hasMore = true` ⇒ truncated, fetch the next page. Look
cells up by `name`, not position — order shifts if `select` changes.
---
## 4. Walk edges (joins)
**Forward (single-valued) relationships are one query**: a dotted path
crosses a declared edge, in any field position. **Reverse (one-to-many)
relationships stay two queries** with the `in` pattern (§4.2).
### 4.1 Forward (child → parent): dotted paths
`"<edgeField>.<targetField>"` reads through the edge server-side — in
`where`, `groupBy`, `orderBy`, `aggregate.field`, and `select`. Project
through an edge in one query:
```bash
icp canister call backend execute '("{\"start\":\"customer\",\"where\":{\"eq\":{\"field\":\"companyName\",\"value\":\"Northstar Public\"}},\"select\":[\"companyName\",\"accountManager.name\",\"accountManager.office\"]}")' --query
```
Multi-hop chains work (`"manager.department.name"`, max 4 hops), and it
composes with aggregation — "average revenue by the account manager's
office" is one call:
```bash
icp canister call backend execute '("{\"start\":\"customer\",\"groupBy\":[\"accountManager.office\"],\"aggregate\":[{\"fn\":\"avg\",\"field\":\"monthlyRevenueUsd\",\"as\":\"avg_mrr\"}],\"orderBy\":[{\"field\":\"avg_mrr\",\"dir\":\"desc\"}]}")' --query
```
Rules:
- The head segment must be a field whose `role` is
`{"edge": {"to": ... }}` in `schema()` — a dotted path into a
non-edge field **traps**, even if its values look like foreign keys
(traversal is schema-driven, not name-guessed). If the author didn't
declare the edge, fall back to the two-query pattern below.
- A null or dangling FK resolves the whole dotted path to `null`
(left-join): the row fails every relation except `ne`, and projects
the cell as `null`.
- **Aggregate from the many side.** Cross-entity aggregates run over the
start entity's rows: `avg` of `"department.budget"` from `employee` is
employee-weighted. For per-department numbers, start from
`department` — or group by the dotted path and aggregate start-entity
fields.
- Selecting the bare edge field (`"accountManager"`) still returns the
FK scalar; there is no `.*` — name each target field you want.
### 4.2 Reverse (one parent → many children)
`eq` for one parent primary key, `in` for a batch — on the edge field,
with the target entity's primary-key values.
```bash
icp canister call backend execute '("{\"start\":\"customer\",\"where\":{\"eq\":{\"field\":\"accountManager\",\"value\":\"daniel@helix.systems\"}},\"select\":[\"companyName\",\"monthlyRevenueUsd\"]}")' --query
```
When the parent condition is a plain predicate, you don't need the batch
— it's a forward filter through the edge (§4.1). "All customers managed
by anyone in the Berlin office" is one query:
```bash
icp canister call backend execute '("{\"start\":\"customer\",\"where\":{\"eq\":{\"field\":\"accountManager.office\",\"value\":\"Berlin\"}},\"select\":[\"companyName\",\"monthlyRevenueUsd\"]}")' --query
```
The batch `in` pattern is required when the parent set needs its own
query shape (top-N, ordered, paginated): collect the keys first, then
`in` on the edge field. "Customers managed by the three most senior
employees" is two queries:
```bash
icp canister call backend execute '("{\"start\":\"employee\",\"orderBy\":[{\"field\":\"level\",\"dir\":\"desc\"}],\"limit\":3,\"select\":[\"email\"]}")' --query
# collect the three emails from the rows, then:
icp canister call backend execute '("{\"start\":\"customer\",\"where\":{\"in\":{\"field\":\"accountManager\",\"value\":[\"alex@helix.systems\",\"james@helix.systems\",\"sarah@helix.systems\"]}},\"select\":[\"companyName\",\"monthlyRevenueUsd\"]}")' --query
```
Always batch with `in` rather than running N separate `eq` queries.
### 4.3 Compound conditions
Stack with `and` / `or`:
```bash
icp canister call backend execute '("{\"start\":\"customer\",\"where\":{\"and\":[{\"eq\":{\"field\":\"plan\",\"value\":\"enterprise\"}},{\"in\":{\"field\":\"country\",\"value\":[\"US\",\"CA\",\"DE\"]}},{\"ge\":{\"field\":\"monthlyRevenueUsd\",\"value\":20000}}]},\"orderBy\":[{\"field\":\"monthlyRevenueUsd\",\"dir\":\"desc\"}]}")' --query
```
### 4.4 Two-hop / self-edge join
When the parent key isn't given but must be looked up first — e.g. "who
reports to the lead of project `forge20`?" — run two queries. The second
filters on a self-edge (`employee.manager` → `employee`) by the key the
first query returned:
```bash
icp canister call backend execute '("{\"start\":\"project\",\"where\":{\"eq\":{\"field\":\"codename\",\"value\":\"forge20\"}},\"select\":[\"lead\"]}")' --query
# the row's `lead` cell is the lead's email, e.g. priya@helix.systems — use it as the parent key:
icp canister call backend execute '("{\"start\":\"employee\",\"where\":{\"eq\":{\"field\":\"manager\",\"value\":\"priya@helix.systems\"}},\"select\":[\"name\",\"jobTitle\",\"level\"]}")' --query
```
---
## 5. Pagination
`limit` caps results. `hasMore` reports truncation. Walk pages with
`offset`:
```text
offset = 0
limit = 25
loop:
result = icp canister call backend execute '("{\"start\":\"...\",\"limit\":25,\"offset\":<offset>,...}")' --query
consume result.rows
if not result.hasMore: break
offset += limit
```
Always set `limit` explicitly. OQL itself imposes no cap (omitting
`limit` returns every match), and a canister author may add one — in
which case over-asking is silently truncated.
---
## 6. Pitfalls
| Symptom | Cause / Fix |
|---|---|
| `execute` traps `OQL: unknown entity '...'` | `start` doesn't match any `name` from `schema()` — entity names are case-sensitive. Re-read the schema. |
| `execute` traps with a parse error | The JSON was malformed (trailing comma, single quotes), or not escaped as a Candid text literal — wrap as `("...")` with every inner `"` escaped as `\"`. Validate the JSON with `python3 -m json.tool` first. |
| `execute` traps `OQL: unknown field '...' on '...' — fields: ...` | Typo in `field` — the trap lists the entity's real fields. Pick one of them. |
| `execute` traps `OQL: invalid query — where: field "..." is Int but value is Text` | The `value` literal's JSON type can never match the field's `typeName` (`"5"` or `"now-7d"` against a numeric field, a number against `Text`/`Bool`; `in` elements are checked one by one). Send a literal of the field's type — numeric fields take any of `Nat`/`Int`/`Float`, and `null` is always the is-null test. |
| No rows returned for a filter you expect to match | The field is genuinely `null_` in storage, or the literal is the right type but the wrong value (case, units — timestamps are epoch nanoseconds). |
| `contains` misses rows you can see | `contains` / `startsWith` / `endsWith` are case-sensitive. Use `icontains` for user-typed search terms. |
| Dotted path traps `'x' is not an edge of 'y'` | The head segment isn't a declared edge — traversal is schema-driven even when values look like FKs. Use the two-query `in` pattern instead. |
| Cross-entity average looks wrong | Aggregates run over the **start** entity's rows. Start from the entity whose rows you want averaged, or group by the dotted path and aggregate start-entity fields. |
| `execute` returns rows but missing fields | A field you `select`-ed isn't in the entity (typo, or hidden by the author). Drop it from `select`, or remove `select` for the default projection. |
There is **no structured error envelope**. Any failure is a trap — fix
the query and retry.
Проверка и особенности
Автоматическая проверка источника и файлов
Автоматически проверены публичный репозиторий, лицензия, заголовок SKILL.md, состав текстового пакета и Git-хеш каждого файла. Пакеты с исполняемыми файлами и срабатываниями применённых статических правил не включены. Ручной аудит всех инструкций и функциональный запуск не проводились. Внешние инструменты и сервисы не проверялись. Проверка не гарантирует безопасность.
В публичном списке установок на 2026-10-09 у скилла было 21 837 установок. Порог отбора — 1 000 установок. Число установок показывает распространённость, а не качество или безопасность инструкции.
- Проверка состава
- 09.10.2026
- Проверенная версия
1b72e52699b9- Файлы с кодом
- Не указаны в данных проверки
- Изменения на GitHub
- Нужна повторная проверкаПоследняя проверка: 11.10.2026
Репозиторий и лицензия
Это показатели всего репозитория, а не установки скилла. Снимок требует обновления.
- Последняя активность GitHub
- 10.10.2026
- Лицензия
- Apache-2.0
- Добавлен в каталог
- 09.10.2026
Полный текст лицензии
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 the 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 the 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 any 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
Copyright 2026 Caffeine Labs AG
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.
Ещё в этой категории
Все в категорииОбсуждение
ПравилаПользовались этим скиллом? Делитесь опытом без регистрации. Все комментарии проверяет модератор.
