carrick 0.3.133 → 0.3.134

package/sidecar/dist/src/validators.js

@@ -83,6 +83,15 @@ export const SymbolRequestSchema = z.object({
 // ============================================================================
 // Infer Request Item Schema
 // ============================================================================
+/**
+ * The library store's label for which part of a call's result holds the
+ * response body (carrick#2818). Exactly one key.
+ */
+export const ResultLabelSchema = z.union([
+    z.object({ whole: z.literal(true) }).strict(),
+    z.object({ member: z.tuple([z.string().min(1)]) }).strict(),
+    z.object({ parse: z.string().min(1) }).strict(),
+]);
 export const InferRequestItemSchema = z.object({
     file_path: z.string().min(1, 'File path cannot be empty'),
     line_number: z.number().int().positive('Line number must be positive'),
@@ -95,6 +104,8 @@ export const InferRequestItemSchema = z.object({
     param_name: z.string().optional(),
     // The body-carrying member a `request_config` item asks about.
     member: z.string().optional(),
+    // The library store's label for the call's result (carrick#2818).
+    result: ResultLabelSchema.optional(),
 });
 /**
  * Per-item locator validation for infer requests.
@@ -189,6 +200,7 @@ const CaptureAnchorRequestSchema = z.discriminatedUnion('kind', [
         // the request.
         param_name: z.string().optional(),
         unwrap: z.enum(['awaited', 'none']).optional(),
+        result: ResultLabelSchema.optional(),
     }),
     z.object({
         kind: z.literal('literal'),
@@ -409,6 +421,12 @@ const RequestAtSchema = z
     body: z.array(z.string().min(1)).optional(),
 })
     .strict();
+/** Exactly one of the whole return, one member name, or a parse method (carrick#2817). */
+const ResultShapeSchema = z.union([
+    z.object({ whole: z.literal(true) }).strict(),
+    z.object({ member: z.tuple([z.string().min(1)]) }).strict(),
+    z.object({ parse: z.string().min(1) }).strict(),
+]);
 const ClaimOnSchema = z.enum(['export', 'instance', 'both']);
 const MemberPathSchema = z.array(z.string().min(1));
 const KeyLabelsSchema = z.record(z.string().min(1), z.enum(['name', 'not_name']));
@@ -436,6 +454,7 @@ const LibraryClaimSchema = z.discriminatedUnion('kind', [
         key_labels: KeyLabelsSchema.optional(),
         name_scope: NameScopeSchema.optional(),
         picker: z.string().optional(),
+        result: ResultShapeSchema.optional(),
     })
         .strict(),
     z
@@ -479,6 +498,19 @@ const LibraryClaimSchema = z.discriminatedUnion('kind', [
         runs: RunsSlotSchema.optional(),
         yields: YieldsSchema.optional(),
         request: RequestAtSchema.optional(),
+        result: ResultShapeSchema.optional(),
+    })
+        .strict(),
+    z
+        .object({
+        kind: z.literal('result'),
+        form: z.enum(['make', 'op']),
+        member: z.string().min(1).nullable(),
+        path: MemberPathSchema.optional(),
+        on: ClaimOnSchema.optional(),
+        of: z.string().min(1).optional(),
+        picker: z.string().optional(),
+        result: ResultShapeSchema,
     })
         .strict(),
     z

package/templates/skills/carrick-reuse.md

@@ -26,6 +26,17 @@ An entry is either a `name` with a `file` for a function the index holds, or a
 the other in an entry, never both. A `name` that matches more than one
 definition comes back with its candidates on that entry's `error`.
 
+Functions you added in this task are not in the index yet, so give each one a
+`description` entry: one plain sentence about what it does, written from the
+code you wrote. Do not look for the names in a file list; you wrote them.
+
+Two limits decide what an empty answer means. The index was taken at the
+commit the answer states, on the default branch, so anything added on this
+branch is compared against that. And the comparison is on what each function is
+described as doing, not on its source: the index holds no body hash.
+
+When you are done, tell the user in one line what Carrick found.
+
 The two kinds are scored on different scales, and each result states the floor
 it was ranked against. `vector_basis` says what the cosines are over. On
 `intent` the vector is the intent sentence alone, and a copy somebody renamed