Orca is the place for working with a fleet of agents (e.g. Grok Bot, Claude Code). Run any coding agent with your own subscription. Available on desktop, mobile and remote runtime.
TypeScript adeagent-ideai-agentsautomationbotclaude-codecodexghosttygrok-bothermes-agentmobile-appmuseopenclawopencodeorchestrationpiruntimeterminalworktreesyc-backed
import {
joinComputerTreeText,
parseComputerTreeText,
type ComputerTreeElement
} from '../shared/computer-use-tree-text'
export type ComputerTreeQuery = {
query?: string
maxElements?: number
}
// Runs in the CLI over the rendered tree, so it works against every runtime version and provider.
export function queryComputerTreeText(treeText: string, options: ComputerTreeQuery): string {
const { header, elements, footer } = parseComputerTreeText(treeText)
const needle = options.query?.toLowerCase()
const candidates = needle
? elements.filter((element) => elementText(element).toLowerCase().includes(needle))
: elements
const shown =
options.maxElements === undefined ? candidates : candidates.slice(0, options.maxElements)
const shownSet = new Set(shown)
const keep = withAncestors(elements, shownSet)
const body = elements.flatMap((element) =>
!keep.has(element) ? [] : shownSet.has(element) ? element.lines : element.lines.slice(0, 1)
)
const note = needle
? candidates.length === 0
? `No elements match "${options.query}".`
: `${candidates.length} of ${elements.length} elements match "${options.query}"; showing ${shown.length === candidates.length ? 'them' : `the first ${shown.length}`} with their ancestors.`
: shown.length < elements.length
? `Showing the first ${shown.length} of ${elements.length} elements.`
: null
return joinComputerTreeText(header, note ? [note, ...body] : body, footer)
}
function elementText(element: ComputerTreeElement): string {
return element.lines[0].trimStart().replace(/^\d+ ?/u, '')
}
function withAncestors(
elements: ComputerTreeElement[],
shown: Set<ComputerTreeElement>
): Set<ComputerTreeElement> {
const keep = new Set<ComputerTreeElement>()
const path: (ComputerTreeElement | undefined)[] = []
for (const element of elements) {
path.length = Math.min(path.length, element.depth)
if (shown.has(element)) {
for (const ancestor of path) {
if (ancestor) {
keep.add(ancestor)
}
}
keep.add(element)
}
path[element.depth] = element
}
return keep
}