@bamboocss/extractor 1.15.0 → 1.16.1

package/dist/index.cjs

@@ -116,6 +116,29 @@ const recipeProps = [
 var BoxNodeMap = class extends BoxNodeType {
 	value;
 	spreadConditions;
+	/**
+	* Spreads the extractor walked structurally, paired with what it walked them into.
+	*
+	* The map records what a spread *contributed*, so a spread that flattened and one that
+	* was silently skipped look identical once folded in — both simply add keys, or fail to.
+	* That ambiguity is why a consumer rewriting source would otherwise have to decline every
+	* spread rather than only the ones it cannot account for.
+	*
+	* The *walked* ones are listed rather than the skipped ones deliberately: a consumer asks
+	* "may I trust this spread", and a list of failures answers that only while it is
+	* exhaustive. A list of successes is safe to be incomplete — the worst an omission costs
+	* is a fold that does not happen.
+	*
+	* `box` is the map the spread flattened, and being here is **not** a promise that every
+	* one of its keys survived — the extractor omits what it cannot evaluate, at any depth. It
+	* is the handle a consumer needs to go and check for itself, which it cannot do from the
+	* flattened result. `node` is the spread's own expression, so the pair can be matched
+	* against the source being inspected.
+	*
+	* Deliberately kept off `value`, and therefore invisible to `unbox` — this describes the
+	* extraction, not the styles, and nothing that generates CSS should see it.
+	*/
+	resolvedSpreads;
 	constructor(definition) {
 		super(definition);
 		this.value = definition.value;
@@ -440,6 +463,8 @@ const getObjectLiteralExpressionPropPairs = (expression, expressionStack, ctx, m
 	if (properties.length === 0) return box.emptyObject(expression, expressionStack);
 	const extractedPropValues = [];
 	const spreadConditions = [];
+	/** Spreads the extractor walked structurally — see `BoxNodeMap.resolvedSpreads`. */
+	const resolvedSpreads = [];
 	properties.forEach((property) => {
 		const stack = [...expressionStack];
 		stack.push(property);
@@ -492,6 +517,10 @@ const getObjectLiteralExpressionPropPairs = (expression, expressionStack, ctx, m
 				maybeObject.value.forEach((nested, propName) => {
 					extractedPropValues.push([propName, nested]);
 				});
+				resolvedSpreads.push({
+					node: initializer,
+					box: maybeObject
+				});
 				return;
 			}
 			if (box.isConditional(maybeObject)) spreadConditions.push(maybeObject);
@@ -503,6 +532,7 @@ const getObjectLiteralExpressionPropPairs = (expression, expressionStack, ctx, m
 		orderedMapValue.set(propName, value);
 	});
 	const map = box.map(orderedMapValue, expression, expressionStack);
+	if (resolvedSpreads.length > 0) map.resolvedSpreads = resolvedSpreads;
 	if (spreadConditions.length > 0) map.spreadConditions = spreadConditions;
 	return map;
 };
@@ -631,6 +661,7 @@ function maybeBoxNode(node, stack, ctx, matchProp) {
 		if (isPlusSyntax(operatorKind)) {
 			const value = tryComputingPlusTokenBinaryExpressionToString(node, stack, ctx) ?? safeEvaluateNode(node, stack, ctx);
 			if (!value) return;
+			if (typeof value === "string" && value.includes("undefined")) return;
 			return cache(box.from(value, node, stack));
 		}
 		if (isLogicalSyntax(operatorKind)) return cache(maybeResolveConditionalExpression({
@@ -1348,6 +1379,34 @@ const runtimeProfiles = [
 		getPropNodes: getArgsAt(1)
 	}
 ];
+/**
+* The declaration `identifier` binds to, found by walking its enclosing scopes outward.
+*
+* Deliberately not `identifier.getDefinitions()`. That is a language-service query, and
+* the first one forces `synchronizeHostData` -> `createProgram`, which resolves, parses
+* and binds the whole transitive `.d.ts` closure of the project — in a 5-file sandbox
+* that is 161 files and 5.1MB, most of it `node_modules`, and it grows with the
+* dependency graph rather than with the user's source. The extractor is built to avoid
+* exactly that: `createTsProject` sets `skipAddingFilesFromTsConfig`,
+* `skipFileDependencyResolution` and `skipLoadingLibFiles`, and `getModuleSpecifierSourceFile`
+* carries the same note. Inside a bundler the program is built alongside the module graph
+* in one heap, so the cost lands as a slow build and then an OOM.
+*
+* A lexical walk is enough because this only ever runs for a callee that is declared in
+* this file: `resolveCallee` matches against the import map first, and `collectImports`
+* covers every import form. Innermost scope wins, which is how the binding resolves
+* anyway, and a scope can hold only one declaration of a given name.
+*/
+const findLocalDeclaration = (identifier) => {
+	const name = identifier.getText();
+	for (let scope = identifier.getParent(); scope; scope = scope.getParent()) {
+		if (!ts_morph.Node.isStatemented(scope)) continue;
+		const variable = scope.getVariableDeclaration(name);
+		if (variable) return variable;
+		const fn = scope.getFunction(name);
+		if (fn) return fn;
+	}
+};
 const createCompiledJsxContext = (sourceFile) => {
 	const imports = collectImports(sourceFile);
 	const normalizeCallee = (node) => {
@@ -1374,30 +1433,26 @@ const createCompiledJsxContext = (sourceFile) => {
 			if (ts_morph.Node.isConditionalExpression(expression)) return resolveLocalAlias(expression.getWhenTrue()) ?? resolveLocalAlias(expression.getWhenFalse());
 			if (ts_morph.Node.isBinaryExpression(expression) && expression.getOperatorToken().getKind() === ts_morph.SyntaxKind.CommaToken) return resolveLocalAlias(expression.getRight());
 		};
-		for (const definition of identifier.getDefinitions()) {
-			const declaration = definition.getDeclarationNode();
-			if (!declaration) continue;
-			if (ts_morph.Node.isFunctionDeclaration(declaration)) {
-				const imported = resolveBundledHelperImport(declaration.getName() ?? name, declaration);
-				if (!imported) continue;
-				const resolved = {
-					mod: imported.mod,
-					importedName: imported.importedName
-				};
-				localDefinitionCache.set(name, resolved);
-				return resolved;
-			}
-			if (ts_morph.Node.isVariableDeclaration(declaration)) {
-				const directImport = resolveBundledHelperImport(declaration.getName(), declaration.getInitializer());
-				const aliasImport = directImport ? {
-					mod: directImport.mod,
-					importedName: directImport.importedName
-				} : resolveLocalAlias(declaration.getInitializer());
-				if (!aliasImport) continue;
-				localDefinitionCache.set(name, aliasImport);
-				return aliasImport;
-			}
+		const declaration = findLocalDeclaration(identifier);
+		if (!declaration) return;
+		if (ts_morph.Node.isFunctionDeclaration(declaration)) {
+			const imported = resolveBundledHelperImport(declaration.getName() ?? name, declaration);
+			if (!imported) return;
+			const resolved = {
+				mod: imported.mod,
+				importedName: imported.importedName
+			};
+			localDefinitionCache.set(name, resolved);
+			return resolved;
 		}
+		const directImport = resolveBundledHelperImport(declaration.getName(), declaration.getInitializer());
+		const aliasImport = directImport ? {
+			mod: directImport.mod,
+			importedName: directImport.importedName
+		} : resolveLocalAlias(declaration.getInitializer());
+		if (!aliasImport) return;
+		localDefinitionCache.set(name, aliasImport);
+		return aliasImport;
 	};
 	const resolveCallee = (node) => {
 		const expression = normalizeCallee(node);
@@ -1492,7 +1547,7 @@ const objectLikeToMap = (maybeObject, node) => {
 const isImportOrExport = (node) => ts_morph.Node.isImportDeclaration(node) || ts_morph.Node.isExportDeclaration(node);
 const isJsxElement = (node) => ts_morph.Node.isJsxOpeningElement(node) || ts_morph.Node.isJsxSelfClosingElement(node);
 const extract = ({ ast, ...ctx }) => {
-	const { components, functions, taggedTemplates } = ctx;
+	const { components, functions } = ctx;
 	const compiledJsx = createCompiledJsxContext(ast);
 	/** contains all the extracted nodes from this ast parsing */
 	const byName = /* @__PURE__ */ new Map();
@@ -1662,6 +1717,7 @@ const extract = ({ ast, ...ctx }) => {
 					});
 					const boxMap = box.map(mapValue, node, boxNode.getStack());
 					if (box.isMap(boxNode) && boxNode.spreadConditions?.length) boxMap.spreadConditions = boxNode.spreadConditions;
+					if (box.isMap(boxNode) && boxNode.resolvedSpreads?.length) boxMap.resolvedSpreads = boxNode.resolvedSpreads;
 					return boxMap;
 				}
 				return boxNode;
@@ -1673,26 +1729,6 @@ const extract = ({ ast, ...ctx }) => {
 			};
 			fnResultMap.queryList.push(query);
 		}
-		if (taggedTemplates && ts_morph.Node.isTaggedTemplateExpression(node)) {
-			const tag = node.getTag();
-			const fnName = ts_morph.Node.isCallExpression(tag) ? tag.getExpression().getText() : tag.getText();
-			if (!taggedTemplates.matchTaggedTemplate({
-				taggedTemplateNode: node,
-				fnName
-			})) return;
-			if (!byName.has(fnName)) byName.set(fnName, {
-				kind: "function",
-				nodesByProp: /* @__PURE__ */ new Map(),
-				queryList: []
-			});
-			const fnResultMap = byName.get(fnName);
-			const query = {
-				kind: "tagged-template",
-				name: fnName,
-				box: maybeBoxNode(node, [], ctx)
-			};
-			fnResultMap.queryList.push(query);
-		}
 	});
 	componentByNode.forEach((parentRef, componentNode) => {
 		const component = componentByNode.get(componentNode);

package/dist/index.d.cts

@@ -1,4 +1,4 @@
-import { BindingElement, CallExpression, EnumDeclaration, Expression, FunctionDeclaration, GetAccessorDeclaration, Identifier, JsxAttribute, JsxOpeningElement, JsxSelfClosingElement, JsxSpreadAttribute, Node, ParameterDeclaration, PropertyAssignment, ShorthandPropertyAssignment, SourceFile, TaggedTemplateExpression, VariableDeclaration } from "ts-morph";
+import { BindingElement, CallExpression, EnumDeclaration, Expression, FunctionDeclaration, GetAccessorDeclaration, Identifier, JsxAttribute, JsxOpeningElement, JsxSelfClosingElement, JsxSpreadAttribute, Node, ParameterDeclaration, PropertyAssignment, ShorthandPropertyAssignment, SourceFile, VariableDeclaration } from "ts-morph";
 import { EvaluateOptions as EvaluateOptions$1 } from "ts-evaluator";
 
 //#region src/box-factory.d.ts
@@ -79,6 +79,32 @@ declare class BoxNodeLiteral extends BoxNodeType$1<LiteralType> {
 declare class BoxNodeMap extends BoxNodeType$1<MapType> {
   value: MapType['value'];
   spreadConditions?: BoxNodeConditional[];
+  /**
+   * Spreads the extractor walked structurally, paired with what it walked them into.
+   *
+   * The map records what a spread *contributed*, so a spread that flattened and one that
+   * was silently skipped look identical once folded in — both simply add keys, or fail to.
+   * That ambiguity is why a consumer rewriting source would otherwise have to decline every
+   * spread rather than only the ones it cannot account for.
+   *
+   * The *walked* ones are listed rather than the skipped ones deliberately: a consumer asks
+   * "may I trust this spread", and a list of failures answers that only while it is
+   * exhaustive. A list of successes is safe to be incomplete — the worst an omission costs
+   * is a fold that does not happen.
+   *
+   * `box` is the map the spread flattened, and being here is **not** a promise that every
+   * one of its keys survived — the extractor omits what it cannot evaluate, at any depth. It
+   * is the handle a consumer needs to go and check for itself, which it cannot do from the
+   * flattened result. `node` is the spread's own expression, so the pair can be matched
+   * against the source being inspected.
+   *
+   * Deliberately kept off `value`, and therefore invisible to `unbox` — this describes the
+   * extraction, not the styles, and nothing that generates CSS should see it.
+   */
+  resolvedSpreads?: Array<{
+    node: Node;
+    box: BoxNodeMap;
+  }>;
   constructor(definition: MapType);
   isRecipe: () => boolean;
 }
@@ -111,16 +137,10 @@ interface ExtractedFunctionInstance {
   fromNode: () => CallExpression;
   box: BoxNodeArray;
 }
-interface ExtractedTaggedTemplateInstance {
-  name: string;
-  kind: 'tagged-template';
-  fromNode: () => TaggedTemplateExpression;
-  box: BoxNodeLiteral;
-}
 interface ExtractedFunctionResult {
   kind: 'function';
   nodesByProp: Map<string, BoxNode[]>;
-  queryList: Array<ExtractedFunctionInstance | ExtractedTaggedTemplateInstance>;
+  queryList: ExtractedFunctionInstance[];
 }
 interface ExtractedComponentInstance {
   name: string;
@@ -164,11 +184,6 @@ interface ComponentMatchers {
   matchTag: (element: MatchTagArgs) => boolean;
   matchProp: (prop: Pick<MatchTagArgs, 'tagName' | 'tagNode'> & MatchPropArgs) => boolean;
 }
-interface MatchTaggedTemplateArgs {
-  fnName: string;
-  taggedTemplateNode: TaggedTemplateExpression;
-}
-type MatchTaggedTemplate = (tag: MatchTaggedTemplateArgs) => boolean;
 interface BoxContext {
   getEvaluateOptions?: (node: Expression, stack: Node[]) => Omit<EvaluateOptions, 'node' | 'policy'> | void;
   canEval?: (node: Expression, stack: Node[]) => boolean;
@@ -190,9 +205,6 @@ type ExtractOptions = BoxContext & {
   ast: SourceFile;
   components?: ComponentMatchers;
   functions?: FunctionMatchers;
-  taggedTemplates?: {
-    matchTaggedTemplate: MatchTaggedTemplate;
-  };
 };
 //#endregion
 //#region src/to-box-node.d.ts

package/dist/index.d.mts

@@ -1,4 +1,4 @@
-import { BindingElement, CallExpression, EnumDeclaration, Expression, FunctionDeclaration, GetAccessorDeclaration, Identifier, JsxAttribute, JsxOpeningElement, JsxSelfClosingElement, JsxSpreadAttribute, Node, ParameterDeclaration, PropertyAssignment, ShorthandPropertyAssignment, SourceFile, TaggedTemplateExpression, VariableDeclaration } from "ts-morph";
+import { BindingElement, CallExpression, EnumDeclaration, Expression, FunctionDeclaration, GetAccessorDeclaration, Identifier, JsxAttribute, JsxOpeningElement, JsxSelfClosingElement, JsxSpreadAttribute, Node, ParameterDeclaration, PropertyAssignment, ShorthandPropertyAssignment, SourceFile, VariableDeclaration } from "ts-morph";
 import { EvaluateOptions as EvaluateOptions$1 } from "ts-evaluator";
 
 //#region src/box-factory.d.ts
@@ -79,6 +79,32 @@ declare class BoxNodeLiteral extends BoxNodeType$1<LiteralType> {
 declare class BoxNodeMap extends BoxNodeType$1<MapType> {
   value: MapType['value'];
   spreadConditions?: BoxNodeConditional[];
+  /**
+   * Spreads the extractor walked structurally, paired with what it walked them into.
+   *
+   * The map records what a spread *contributed*, so a spread that flattened and one that
+   * was silently skipped look identical once folded in — both simply add keys, or fail to.
+   * That ambiguity is why a consumer rewriting source would otherwise have to decline every
+   * spread rather than only the ones it cannot account for.
+   *
+   * The *walked* ones are listed rather than the skipped ones deliberately: a consumer asks
+   * "may I trust this spread", and a list of failures answers that only while it is
+   * exhaustive. A list of successes is safe to be incomplete — the worst an omission costs
+   * is a fold that does not happen.
+   *
+   * `box` is the map the spread flattened, and being here is **not** a promise that every
+   * one of its keys survived — the extractor omits what it cannot evaluate, at any depth. It
+   * is the handle a consumer needs to go and check for itself, which it cannot do from the
+   * flattened result. `node` is the spread's own expression, so the pair can be matched
+   * against the source being inspected.
+   *
+   * Deliberately kept off `value`, and therefore invisible to `unbox` — this describes the
+   * extraction, not the styles, and nothing that generates CSS should see it.
+   */
+  resolvedSpreads?: Array<{
+    node: Node;
+    box: BoxNodeMap;
+  }>;
   constructor(definition: MapType);
   isRecipe: () => boolean;
 }
@@ -111,16 +137,10 @@ interface ExtractedFunctionInstance {
   fromNode: () => CallExpression;
   box: BoxNodeArray;
 }
-interface ExtractedTaggedTemplateInstance {
-  name: string;
-  kind: 'tagged-template';
-  fromNode: () => TaggedTemplateExpression;
-  box: BoxNodeLiteral;
-}
 interface ExtractedFunctionResult {
   kind: 'function';
   nodesByProp: Map<string, BoxNode[]>;
-  queryList: Array<ExtractedFunctionInstance | ExtractedTaggedTemplateInstance>;
+  queryList: ExtractedFunctionInstance[];
 }
 interface ExtractedComponentInstance {
   name: string;
@@ -164,11 +184,6 @@ interface ComponentMatchers {
   matchTag: (element: MatchTagArgs) => boolean;
   matchProp: (prop: Pick<MatchTagArgs, 'tagName' | 'tagNode'> & MatchPropArgs) => boolean;
 }
-interface MatchTaggedTemplateArgs {
-  fnName: string;
-  taggedTemplateNode: TaggedTemplateExpression;
-}
-type MatchTaggedTemplate = (tag: MatchTaggedTemplateArgs) => boolean;
 interface BoxContext {
   getEvaluateOptions?: (node: Expression, stack: Node[]) => Omit<EvaluateOptions, 'node' | 'policy'> | void;
   canEval?: (node: Expression, stack: Node[]) => boolean;
@@ -190,9 +205,6 @@ type ExtractOptions = BoxContext & {
   ast: SourceFile;
   components?: ComponentMatchers;
   functions?: FunctionMatchers;
-  taggedTemplates?: {
-    matchTaggedTemplate: MatchTaggedTemplate;
-  };
 };
 //#endregion
 //#region src/to-box-node.d.ts

package/dist/index.mjs

@@ -115,6 +115,29 @@ const recipeProps = [
 var BoxNodeMap = class extends BoxNodeType {
 	value;
 	spreadConditions;
+	/**
+	* Spreads the extractor walked structurally, paired with what it walked them into.
+	*
+	* The map records what a spread *contributed*, so a spread that flattened and one that
+	* was silently skipped look identical once folded in — both simply add keys, or fail to.
+	* That ambiguity is why a consumer rewriting source would otherwise have to decline every
+	* spread rather than only the ones it cannot account for.
+	*
+	* The *walked* ones are listed rather than the skipped ones deliberately: a consumer asks
+	* "may I trust this spread", and a list of failures answers that only while it is
+	* exhaustive. A list of successes is safe to be incomplete — the worst an omission costs
+	* is a fold that does not happen.
+	*
+	* `box` is the map the spread flattened, and being here is **not** a promise that every
+	* one of its keys survived — the extractor omits what it cannot evaluate, at any depth. It
+	* is the handle a consumer needs to go and check for itself, which it cannot do from the
+	* flattened result. `node` is the spread's own expression, so the pair can be matched
+	* against the source being inspected.
+	*
+	* Deliberately kept off `value`, and therefore invisible to `unbox` — this describes the
+	* extraction, not the styles, and nothing that generates CSS should see it.
+	*/
+	resolvedSpreads;
 	constructor(definition) {
 		super(definition);
 		this.value = definition.value;
@@ -439,6 +462,8 @@ const getObjectLiteralExpressionPropPairs = (expression, expressionStack, ctx, m
 	if (properties.length === 0) return box.emptyObject(expression, expressionStack);
 	const extractedPropValues = [];
 	const spreadConditions = [];
+	/** Spreads the extractor walked structurally — see `BoxNodeMap.resolvedSpreads`. */
+	const resolvedSpreads = [];
 	properties.forEach((property) => {
 		const stack = [...expressionStack];
 		stack.push(property);
@@ -491,6 +516,10 @@ const getObjectLiteralExpressionPropPairs = (expression, expressionStack, ctx, m
 				maybeObject.value.forEach((nested, propName) => {
 					extractedPropValues.push([propName, nested]);
 				});
+				resolvedSpreads.push({
+					node: initializer,
+					box: maybeObject
+				});
 				return;
 			}
 			if (box.isConditional(maybeObject)) spreadConditions.push(maybeObject);
@@ -502,6 +531,7 @@ const getObjectLiteralExpressionPropPairs = (expression, expressionStack, ctx, m
 		orderedMapValue.set(propName, value);
 	});
 	const map = box.map(orderedMapValue, expression, expressionStack);
+	if (resolvedSpreads.length > 0) map.resolvedSpreads = resolvedSpreads;
 	if (spreadConditions.length > 0) map.spreadConditions = spreadConditions;
 	return map;
 };
@@ -630,6 +660,7 @@ function maybeBoxNode(node, stack, ctx, matchProp) {
 		if (isPlusSyntax(operatorKind)) {
 			const value = tryComputingPlusTokenBinaryExpressionToString(node, stack, ctx) ?? safeEvaluateNode(node, stack, ctx);
 			if (!value) return;
+			if (typeof value === "string" && value.includes("undefined")) return;
 			return cache(box.from(value, node, stack));
 		}
 		if (isLogicalSyntax(operatorKind)) return cache(maybeResolveConditionalExpression({
@@ -1347,6 +1378,34 @@ const runtimeProfiles = [
 		getPropNodes: getArgsAt(1)
 	}
 ];
+/**
+* The declaration `identifier` binds to, found by walking its enclosing scopes outward.
+*
+* Deliberately not `identifier.getDefinitions()`. That is a language-service query, and
+* the first one forces `synchronizeHostData` -> `createProgram`, which resolves, parses
+* and binds the whole transitive `.d.ts` closure of the project — in a 5-file sandbox
+* that is 161 files and 5.1MB, most of it `node_modules`, and it grows with the
+* dependency graph rather than with the user's source. The extractor is built to avoid
+* exactly that: `createTsProject` sets `skipAddingFilesFromTsConfig`,
+* `skipFileDependencyResolution` and `skipLoadingLibFiles`, and `getModuleSpecifierSourceFile`
+* carries the same note. Inside a bundler the program is built alongside the module graph
+* in one heap, so the cost lands as a slow build and then an OOM.
+*
+* A lexical walk is enough because this only ever runs for a callee that is declared in
+* this file: `resolveCallee` matches against the import map first, and `collectImports`
+* covers every import form. Innermost scope wins, which is how the binding resolves
+* anyway, and a scope can hold only one declaration of a given name.
+*/
+const findLocalDeclaration = (identifier) => {
+	const name = identifier.getText();
+	for (let scope = identifier.getParent(); scope; scope = scope.getParent()) {
+		if (!Node.isStatemented(scope)) continue;
+		const variable = scope.getVariableDeclaration(name);
+		if (variable) return variable;
+		const fn = scope.getFunction(name);
+		if (fn) return fn;
+	}
+};
 const createCompiledJsxContext = (sourceFile) => {
 	const imports = collectImports(sourceFile);
 	const normalizeCallee = (node) => {
@@ -1373,30 +1432,26 @@ const createCompiledJsxContext = (sourceFile) => {
 			if (Node.isConditionalExpression(expression)) return resolveLocalAlias(expression.getWhenTrue()) ?? resolveLocalAlias(expression.getWhenFalse());
 			if (Node.isBinaryExpression(expression) && expression.getOperatorToken().getKind() === SyntaxKind.CommaToken) return resolveLocalAlias(expression.getRight());
 		};
-		for (const definition of identifier.getDefinitions()) {
-			const declaration = definition.getDeclarationNode();
-			if (!declaration) continue;
-			if (Node.isFunctionDeclaration(declaration)) {
-				const imported = resolveBundledHelperImport(declaration.getName() ?? name, declaration);
-				if (!imported) continue;
-				const resolved = {
-					mod: imported.mod,
-					importedName: imported.importedName
-				};
-				localDefinitionCache.set(name, resolved);
-				return resolved;
-			}
-			if (Node.isVariableDeclaration(declaration)) {
-				const directImport = resolveBundledHelperImport(declaration.getName(), declaration.getInitializer());
-				const aliasImport = directImport ? {
-					mod: directImport.mod,
-					importedName: directImport.importedName
-				} : resolveLocalAlias(declaration.getInitializer());
-				if (!aliasImport) continue;
-				localDefinitionCache.set(name, aliasImport);
-				return aliasImport;
-			}
+		const declaration = findLocalDeclaration(identifier);
+		if (!declaration) return;
+		if (Node.isFunctionDeclaration(declaration)) {
+			const imported = resolveBundledHelperImport(declaration.getName() ?? name, declaration);
+			if (!imported) return;
+			const resolved = {
+				mod: imported.mod,
+				importedName: imported.importedName
+			};
+			localDefinitionCache.set(name, resolved);
+			return resolved;
 		}
+		const directImport = resolveBundledHelperImport(declaration.getName(), declaration.getInitializer());
+		const aliasImport = directImport ? {
+			mod: directImport.mod,
+			importedName: directImport.importedName
+		} : resolveLocalAlias(declaration.getInitializer());
+		if (!aliasImport) return;
+		localDefinitionCache.set(name, aliasImport);
+		return aliasImport;
 	};
 	const resolveCallee = (node) => {
 		const expression = normalizeCallee(node);
@@ -1491,7 +1546,7 @@ const objectLikeToMap = (maybeObject, node) => {
 const isImportOrExport = (node) => Node.isImportDeclaration(node) || Node.isExportDeclaration(node);
 const isJsxElement = (node) => Node.isJsxOpeningElement(node) || Node.isJsxSelfClosingElement(node);
 const extract = ({ ast, ...ctx }) => {
-	const { components, functions, taggedTemplates } = ctx;
+	const { components, functions } = ctx;
 	const compiledJsx = createCompiledJsxContext(ast);
 	/** contains all the extracted nodes from this ast parsing */
 	const byName = /* @__PURE__ */ new Map();
@@ -1661,6 +1716,7 @@ const extract = ({ ast, ...ctx }) => {
 					});
 					const boxMap = box.map(mapValue, node, boxNode.getStack());
 					if (box.isMap(boxNode) && boxNode.spreadConditions?.length) boxMap.spreadConditions = boxNode.spreadConditions;
+					if (box.isMap(boxNode) && boxNode.resolvedSpreads?.length) boxMap.resolvedSpreads = boxNode.resolvedSpreads;
 					return boxMap;
 				}
 				return boxNode;
@@ -1672,26 +1728,6 @@ const extract = ({ ast, ...ctx }) => {
 			};
 			fnResultMap.queryList.push(query);
 		}
-		if (taggedTemplates && Node.isTaggedTemplateExpression(node)) {
-			const tag = node.getTag();
-			const fnName = Node.isCallExpression(tag) ? tag.getExpression().getText() : tag.getText();
-			if (!taggedTemplates.matchTaggedTemplate({
-				taggedTemplateNode: node,
-				fnName
-			})) return;
-			if (!byName.has(fnName)) byName.set(fnName, {
-				kind: "function",
-				nodesByProp: /* @__PURE__ */ new Map(),
-				queryList: []
-			});
-			const fnResultMap = byName.get(fnName);
-			const query = {
-				kind: "tagged-template",
-				name: fnName,
-				box: maybeBoxNode(node, [], ctx)
-			};
-			fnResultMap.queryList.push(query);
-		}
 	});
 	componentByNode.forEach((parentRef, componentNode) => {
 		const component = componentByNode.get(componentNode);

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@bamboocss/extractor",
-  "version": "1.15.0",
+  "version": "1.16.1",
   "description": "The css extractor for css bamboo",
   "homepage": "https://bamboocss.com",
   "license": "MIT",
@@ -35,7 +35,7 @@
   "dependencies": {
     "ts-evaluator": "1.2.0",
     "ts-morph": "28.0.0",
-    "@bamboocss/shared": "1.15.0"
+    "@bamboocss/shared": "1.16.1"
   },
   "scripts": {
     "build": "tsdown src/index.ts --format=cjs,esm --shims --dts",