3. Boolean search - multi-token AND

Returns documents whose description contains both wireless and headphones. Tokens are intersected. The tokens can appear in any order and anywhere in the document - for "in order, next to each other," use phrase mode.

• Filtering down a result set by multiple required attributes ("organic" AND "coffee").
• Tag intersections - any doc that mentions every tag.
• You don't care about ranking and you want the smallest possible response.

Tokens are space-separated in q. Some clients show this URL-encoded as wireless+headphones - same thing.

curl -G "https://$OC_HOST/v1/tenants/$OC_TENANT/fts/shop.products/description" \
  -H "Authorization: Bearer $OC_TOKEN" \
  --data-urlencode "q=wireless headphones" \
  --data-urlencode "mode=boolean"

hits = db.fts.search(
    "shop.products",
    "description",
    q="wireless headphones",
    mode="boolean",
)
for doc_id in hits.doc_ids:
    print(doc_id)

const hits = await db.ftsSearch("shop.products", "description", {
  q: "wireless headphones",
  mode: "boolean",
});
for (const docId of hits.doc_ids) {
  console.log(docId);
}

hits, _ := db.FTSSearch(ctx, "shop.products", "description", originchain.FTSSearchRequest{
    Q:    "wireless headphones",
    Mode: "boolean",
})
for _, docID := range hits.DocIDs {
    fmt.Println(docID)
}

{
  "mode": "boolean",
  "doc_ids": ["p001", "p027"]
}

• The query is tokenised into a list - here ["wireless", "headphones"].
• The engine fetches the posting list for each token and intersects them. Smallest list first keeps the work bounded by the rarest term.
• The intersection is the answer. No scoring is computed.