@butlr/butlr-mcp-server 0.2.0 → 0.4.0
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/dist/cache/topology-cache.d.ts +18 -3
- package/dist/cache/topology-cache.d.ts.map +1 -1
- package/dist/cache/topology-cache.js +19 -3
- package/dist/cache/topology-cache.js.map +1 -1
- package/dist/clients/queries/tags.d.ts +63 -6
- package/dist/clients/queries/tags.d.ts.map +1 -1
- package/dist/clients/queries/tags.js +26 -4
- package/dist/clients/queries/tags.js.map +1 -1
- package/dist/clients/types.d.ts +4 -0
- package/dist/clients/types.d.ts.map +1 -1
- package/dist/errors/mcp-errors.d.ts +34 -0
- package/dist/errors/mcp-errors.d.ts.map +1 -1
- package/dist/errors/mcp-errors.js +71 -5
- package/dist/errors/mcp-errors.js.map +1 -1
- package/dist/tools/butlr-available-rooms.d.ts +5 -23
- package/dist/tools/butlr-available-rooms.d.ts.map +1 -1
- package/dist/tools/butlr-available-rooms.js +104 -51
- package/dist/tools/butlr-available-rooms.js.map +1 -1
- package/dist/tools/butlr-fetch-entity-details.d.ts.map +1 -1
- package/dist/tools/butlr-fetch-entity-details.js +7 -1
- package/dist/tools/butlr-fetch-entity-details.js.map +1 -1
- package/dist/tools/butlr-get-asset-details.d.ts.map +1 -1
- package/dist/tools/butlr-get-asset-details.js +29 -4
- package/dist/tools/butlr-get-asset-details.js.map +1 -1
- package/dist/tools/butlr-get-current-occupancy.d.ts.map +1 -1
- package/dist/tools/butlr-get-current-occupancy.js +14 -3
- package/dist/tools/butlr-get-current-occupancy.js.map +1 -1
- package/dist/tools/butlr-get-occupancy-timeseries.d.ts.map +1 -1
- package/dist/tools/butlr-get-occupancy-timeseries.js +15 -4
- package/dist/tools/butlr-get-occupancy-timeseries.js.map +1 -1
- package/dist/tools/butlr-list-tags.d.ts +28 -10
- package/dist/tools/butlr-list-tags.d.ts.map +1 -1
- package/dist/tools/butlr-list-tags.js +81 -24
- package/dist/tools/butlr-list-tags.js.map +1 -1
- package/dist/tools/butlr-list-topology.d.ts +7 -1
- package/dist/tools/butlr-list-topology.d.ts.map +1 -1
- package/dist/tools/butlr-list-topology.js +845 -35
- package/dist/tools/butlr-list-topology.js.map +1 -1
- package/dist/tools/butlr-search-assets.d.ts.map +1 -1
- package/dist/tools/butlr-search-assets.js +7 -1
- package/dist/tools/butlr-search-assets.js.map +1 -1
- package/dist/tools/butlr-space-busyness.d.ts.map +1 -1
- package/dist/tools/butlr-space-busyness.js +17 -2
- package/dist/tools/butlr-space-busyness.js.map +1 -1
- package/dist/tools/butlr-traffic-flow.d.ts.map +1 -1
- package/dist/tools/butlr-traffic-flow.js +9 -3
- package/dist/tools/butlr-traffic-flow.js.map +1 -1
- package/dist/types/responses.d.ts +123 -5
- package/dist/types/responses.d.ts.map +1 -1
- package/dist/utils/field-validator.d.ts.map +1 -1
- package/dist/utils/field-validator.js +3 -0
- package/dist/utils/field-validator.js.map +1 -1
- package/dist/utils/occupancy-helpers.d.ts.map +1 -1
- package/dist/utils/occupancy-helpers.js +18 -4
- package/dist/utils/occupancy-helpers.js.map +1 -1
- package/dist/utils/tag-resolver.d.ts +99 -0
- package/dist/utils/tag-resolver.d.ts.map +1 -0
- package/dist/utils/tag-resolver.js +108 -0
- package/dist/utils/tag-resolver.js.map +1 -0
- package/package.json +1 -1
|
@@ -8,7 +8,7 @@
|
|
|
8
8
|
import { apolloClient } from "../clients/graphql-client.js";
|
|
9
9
|
import { GET_ALL_SENSORS, GET_FULL_TOPOLOGY } from "../clients/queries/topology.js";
|
|
10
10
|
import { detectAssetType } from "./asset-helpers.js";
|
|
11
|
-
import { isProductionSensor } from "./graphql-helpers.js";
|
|
11
|
+
import { isProductionSensor, throwIfGraphQLErrors } from "./graphql-helpers.js";
|
|
12
12
|
import { getTimezoneForAsset, buildTimezoneMetadata } from "./timezone-helpers.js";
|
|
13
13
|
import { rethrowIfGraphQLError } from "./graphql-helpers.js";
|
|
14
14
|
/**
|
|
@@ -28,6 +28,8 @@ export async function fetchTopologyAndSensors() {
|
|
|
28
28
|
fetchPolicy: "network-only",
|
|
29
29
|
}),
|
|
30
30
|
]);
|
|
31
|
+
throwIfGraphQLErrors(topoResult);
|
|
32
|
+
throwIfGraphQLErrors(sensorsResult);
|
|
31
33
|
}
|
|
32
34
|
catch (error) {
|
|
33
35
|
rethrowIfGraphQLError(error);
|
|
@@ -58,7 +60,11 @@ export function resolveAssetContext(assetId, ctx) {
|
|
|
58
60
|
: undefined;
|
|
59
61
|
// Resolve asset name
|
|
60
62
|
const assetName = findAssetName(assetId, typedAssetType, ctx.floors);
|
|
61
|
-
// Filter sensors for this asset
|
|
63
|
+
// Filter sensors for this asset. Zones have no direct sensor attribution —
|
|
64
|
+
// zone_occupancy is computed server-side and is not a roll-up of any
|
|
65
|
+
// single sensor we can identify client-side. The callers (current /
|
|
66
|
+
// timeseries occupancy tools) detect zones by asset_type and query
|
|
67
|
+
// anyway; the sensor count is correctly reported as 0 for zones.
|
|
62
68
|
const assetSensors = ctx.productionSensors.filter((s) => {
|
|
63
69
|
const sensorFloorId = s.floor_id || s.floorID;
|
|
64
70
|
const sensorRoomId = s.room_id || s.roomID;
|
|
@@ -68,7 +74,7 @@ export function resolveAssetContext(assetId, ctx) {
|
|
|
68
74
|
case "room":
|
|
69
75
|
return sensorRoomId === assetId;
|
|
70
76
|
case "zone":
|
|
71
|
-
return false; // Zones
|
|
77
|
+
return false; // Zones do not inherit room sensors — see comment above.
|
|
72
78
|
}
|
|
73
79
|
});
|
|
74
80
|
// Partition sensors by mode
|
|
@@ -76,10 +82,18 @@ export function resolveAssetContext(assetId, ctx) {
|
|
|
76
82
|
let trafficSensors;
|
|
77
83
|
switch (typedAssetType) {
|
|
78
84
|
case "floor":
|
|
85
|
+
// Floor-level traffic comes from the building/floor entrances.
|
|
79
86
|
trafficSensors = assetSensors.filter((s) => s.mode === "traffic" && s.is_entrance === true);
|
|
80
87
|
break;
|
|
81
88
|
case "room":
|
|
82
|
-
|
|
89
|
+
// Room-level traffic includes every traffic-mode sensor bound to the
|
|
90
|
+
// room. `is_entrance` is a semantic flag indicating the sensor sits at
|
|
91
|
+
// a building/floor entrance — it is not a routing flag. The Reporting
|
|
92
|
+
// API aggregates by `room_id` regardless, so filtering on
|
|
93
|
+
// `is_entrance === false` here would silently drop counts for rooms
|
|
94
|
+
// whose sensors are all entrances (e.g. a café occupying the floor's
|
|
95
|
+
// entry area).
|
|
96
|
+
trafficSensors = assetSensors.filter((s) => s.mode === "traffic");
|
|
83
97
|
break;
|
|
84
98
|
default:
|
|
85
99
|
trafficSensors = [];
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"occupancy-helpers.js","sourceRoot":"","sources":["../../src/utils/occupancy-helpers.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,EAAE,YAAY,EAAE,MAAM,8BAA8B,CAAC;AAC5D,OAAO,EAAE,eAAe,EAAE,iBAAiB,EAAE,MAAM,gCAAgC,CAAC;AAIpF,OAAO,EAAE,eAAe,EAAE,MAAM,oBAAoB,CAAC;AACrD,OAAO,EAAE,kBAAkB,EAAE,MAAM,sBAAsB,CAAC;
|
|
1
|
+
{"version":3,"file":"occupancy-helpers.js","sourceRoot":"","sources":["../../src/utils/occupancy-helpers.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,EAAE,YAAY,EAAE,MAAM,8BAA8B,CAAC;AAC5D,OAAO,EAAE,eAAe,EAAE,iBAAiB,EAAE,MAAM,gCAAgC,CAAC;AAIpF,OAAO,EAAE,eAAe,EAAE,MAAM,oBAAoB,CAAC;AACrD,OAAO,EAAE,kBAAkB,EAAE,oBAAoB,EAAE,MAAM,sBAAsB,CAAC;AAChF,OAAO,EAAE,mBAAmB,EAAE,qBAAqB,EAAE,MAAM,uBAAuB,CAAC;AACnF,OAAO,EAAE,qBAAqB,EAAE,MAAM,sBAAsB,CAAC;AAY7D;;;GAGG;AACH,MAAM,CAAC,KAAK,UAAU,uBAAuB;IAC3C,IAAI,UAAU,EAAE,aAAa,CAAC;IAE9B,IAAI,CAAC;QACH,CAAC,UAAU,EAAE,aAAa,CAAC,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC;YAC9C,YAAY,CAAC,KAAK,CAA8B;gBAC9C,KAAK,EAAE,iBAAiB;gBACxB,WAAW,EAAE,cAAc;aAC5B,CAAC;YACF,YAAY,CAAC,KAAK,CAAkC;gBAClD,KAAK,EAAE,eAAe;gBACtB,WAAW,EAAE,cAAc;aAC5B,CAAC;SACH,CAAC,CAAC;QACH,oBAAoB,CAAC,UAAU,CAAC,CAAC;QACjC,oBAAoB,CAAC,aAAa,CAAC,CAAC;IACtC,CAAC;IAAC,OAAO,KAAc,EAAE,CAAC;QACxB,qBAAqB,CAAC,KAAK,CAAC,CAAC;QAC7B,MAAM,KAAK,CAAC;IACd,CAAC;IAED,MAAM,KAAK,GAAG,UAAU,CAAC,IAAI,EAAE,KAAK,EAAE,IAAI,IAAI,EAAE,CAAC;IACjD,MAAM,SAAS,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,IAAI,EAAE,CAAC,CAAC;IAC1D,MAAM,MAAM,GAAG,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,IAAI,EAAE,CAAC,CAAC;IACxD,MAAM,UAAU,GAAG,aAAa,CAAC,IAAI,EAAE,OAAO,EAAE,IAAI,IAAI,EAAE,CAAC;IAC3D,MAAM,iBAAiB,GAAG,UAAU,CAAC,MAAM,CAAC,kBAAkB,CAAC,CAAC;IAEhE,OAAO,EAAE,KAAK,EAAE,SAAS,EAAE,MAAM,EAAE,iBAAiB,EAAE,CAAC;AACzD,CAAC;AAgBD;;GAEG;AACH,MAAM,UAAU,mBAAmB,CAAC,OAAe,EAAE,GAAoB;IACvE,MAAM,SAAS,GAAG,eAAe,CAAC,OAAO,CAAC,CAAC;IAE3C,IAAI,CAAC,CAAC,OAAO,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC,QAAQ,CAAC,SAAS,CAAC,EAAE,CAAC;QACnD,MAAM,IAAI,KAAK,CAAC,SAAS,OAAO,yCAAyC,SAAS,EAAE,CAAC,CAAC;IACxF,CAAC;IAED,MAAM,cAAc,GAAG,SAAsC,CAAC;IAE9D,wFAAwF;IACxF,MAAM,QAAQ,GAAG,mBAAmB,CAClC,OAAO,EACP,cAAc,EACd,GAAG,CAAC,MAAM,EACV,GAAG,CAAC,SAAS,EACb,GAAG,CAAC,KAAK,CACV,CAAC;IAEF,MAAM,QAAQ,GAAG,QAAQ,CAAC,QAAQ,CAAC;IACnC,MAAM,UAAU,GAAG,qBAAqB,CAAC,QAAQ,CAAC,CAAC;IACnD,MAAM,eAAe,GAAG,QAAQ,CAAC,UAAU;QACzC,CAAC,CAAC,+CAA+C,OAAO,WAAW,QAAQ,yEAAyE;QACpJ,CAAC,CAAC,SAAS,CAAC;IAEd,qBAAqB;IACrB,MAAM,SAAS,GAAG,aAAa,CAAC,OAAO,EAAE,cAAc,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;IAErE,2EAA2E;IAC3E,qEAAqE;IACrE,oEAAoE;IACpE,mEAAmE;IACnE,iEAAiE;IACjE,MAAM,YAAY,GAAG,GAAG,CAAC,iBAAiB,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE;QACtD,MAAM,aAAa,GAAG,CAAC,CAAC,QAAQ,IAAI,CAAC,CAAC,OAAO,CAAC;QAC9C,MAAM,YAAY,GAAG,CAAC,CAAC,OAAO,IAAI,CAAC,CAAC,MAAM,CAAC;QAE3C,QAAQ,cAAc,EAAE,CAAC;YACvB,KAAK,OAAO;gBACV,OAAO,aAAa,KAAK,OAAO,CAAC;YACnC,KAAK,MAAM;gBACT,OAAO,YAAY,KAAK,OAAO,CAAC;YAClC,KAAK,MAAM;gBACT,OAAO,KAAK,CAAC,CAAC,yDAAyD;QAC3E,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,4BAA4B;IAC5B,MAAM,eAAe,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,UAAU,CAAC,CAAC;IAE1E,IAAI,cAAwB,CAAC;IAC7B,QAAQ,cAAc,EAAE,CAAC;QACvB,KAAK,OAAO;YACV,+DAA+D;YAC/D,cAAc,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,SAAS,IAAI,CAAC,CAAC,WAAW,KAAK,IAAI,CAAC,CAAC;YAC5F,MAAM;QACR,KAAK,MAAM;YACT,qEAAqE;YACrE,uEAAuE;YACvE,sEAAsE;YACtE,0DAA0D;YAC1D,oEAAoE;YACpE,qEAAqE;YACrE,eAAe;YACf,cAAc,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC;YAClE,MAAM;QACR;YACE,cAAc,GAAG,EAAE,CAAC;IACxB,CAAC;IAED,OAAO;QACL,SAAS,EAAE,cAAc;QACzB,SAAS;QACT,QAAQ;QACR,UAAU;QACV,gBAAgB,EAAE,QAAQ,CAAC,UAAU;QACrC,eAAe;QACf,eAAe;QACf,cAAc;KACf,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,SAAS,aAAa,CACpB,OAAe,EACf,SAAoC,EACpC,MAAe;IAEf,QAAQ,SAAS,EAAE,CAAC;QAClB,KAAK,OAAO;YACV,OAAO,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,OAAO,CAAC,EAAE,IAAI,CAAC;QACpD,KAAK,MAAM;YACT,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;gBAC3B,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,OAAO,CAAC,CAAC;gBACxD,IAAI,IAAI;oBAAE,OAAO,IAAI,CAAC,IAAI,CAAC;YAC7B,CAAC;YACD,OAAO,SAAS,CAAC;QACnB,KAAK,MAAM;YACT,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;gBAC3B,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,OAAO,CAAC,CAAC;gBACxD,IAAI,IAAI;oBAAE,OAAO,IAAI,CAAC,IAAI,CAAC;YAC7B,CAAC;YACD,OAAO,SAAS,CAAC;IACrB,CAAC;AACH,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,sBAAsB,CAAC,SAAoC;IACzE,QAAQ,SAAS,EAAE,CAAC;QAClB,KAAK,OAAO;YACV,OAAO,iBAAiB,CAAC;QAC3B,KAAK,MAAM;YACT,OAAO,gBAAgB,CAAC;QAC1B,KAAK,MAAM;YACT,OAAO,gBAAgB,CAAC;IAC5B,CAAC;AACH,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,qBAAqB,CAAC,SAA2B;IAC/D,QAAQ,SAAS,EAAE,CAAC;QAClB,KAAK,OAAO;YACV,OAAO,yBAAyB,CAAC;QACnC,KAAK,MAAM;YACT,OAAO,wBAAwB,CAAC;IACpC,CAAC;AACH,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,uBAAuB,CACrC,SAAoC,EACpC,WAAmB;IAEnB,IAAI,WAAW,KAAK,CAAC,EAAE,CAAC;QACtB,OAAO,SAAS,KAAK,MAAM;YACzB,CAAC,CAAC,0CAA0C;YAC5C,CAAC,CAAC,+BAA+B,SAAS,GAAG,CAAC;IAClD,CAAC;IACD,OAAO,SAAS,KAAK,OAAO;QAC1B,CAAC,CAAC,iBAAiB,WAAW,wCAAwC;QACtE,CAAC,CAAC,iBAAiB,WAAW,WAAW,CAAC;AAC9C,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,sBAAsB,CACpC,SAAoC,EACpC,WAAmB;IAEnB,IAAI,WAAW,KAAK,CAAC,EAAE,CAAC;QACtB,IAAI,SAAS,KAAK,MAAM;YAAE,OAAO,+BAA+B,CAAC;QACjE,IAAI,SAAS,KAAK,OAAO;YAAE,OAAO,2BAA2B,CAAC;QAC9D,OAAO,qBAAqB,CAAC;IAC/B,CAAC;IACD,OAAO,SAAS,KAAK,OAAO;QAC1B,CAAC,CAAC,gBAAgB,WAAW,yBAAyB;QACtD,CAAC,CAAC,gBAAgB,WAAW,WAAW,CAAC;AAC7C,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,mBAAmB,CACjC,QAA6B,EAC7B,OAA4B,EAC5B,eAAwB,EACxB,cAAuB;IAEvB,MAAM,iBAAiB,GAAG,QAAQ,CAAC,SAAS,IAAI,eAAe,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC;IACrF,MAAM,gBAAgB,GAAG,OAAO,CAAC,SAAS,IAAI,cAAc,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC;IAEjF,IAAI,iBAAiB,IAAI,gBAAgB,EAAE,CAAC;QAC1C,OAAO;YACL,uBAAuB,EAAE,UAAU;YACnC,qBAAqB,EACnB,uEAAuE;SAC1E,CAAC;IACJ,CAAC;IACD,IAAI,iBAAiB,EAAE,CAAC;QACtB,OAAO;YACL,uBAAuB,EAAE,UAAU;YACnC,qBAAqB,EAAE,6CAA6C;SACrE,CAAC;IACJ,CAAC;IACD,IAAI,gBAAgB,EAAE,CAAC;QACrB,OAAO;YACL,uBAAuB,EAAE,SAAS;YAClC,qBAAqB,EAAE,wCAAwC;SAChE,CAAC;IACJ,CAAC;IAED,MAAM,aAAa,GAAG,QAAQ,CAAC,OAAO,IAAI,OAAO,CAAC,OAAO,IAAI,8BAA8B,CAAC;IAC5F,OAAO;QACL,uBAAuB,EAAE,MAAM;QAC/B,qBAAqB,EAAE,aAAa;KACrC,CAAC;AACJ,CAAC"}
|
|
@@ -0,0 +1,99 @@
|
|
|
1
|
+
import { type TagId, type TagMatch, type TagName, type TaggedEntityRef } from "../clients/queries/tags.js";
|
|
2
|
+
/**
|
|
3
|
+
* Pure tag-name → tag-row resolution shared by `butlr_available_rooms` and
|
|
4
|
+
* `butlr_list_topology`. Pure-function over an already-fetched row list so
|
|
5
|
+
* each caller can fetch the minimum tag shape it needs without the helper
|
|
6
|
+
* having to know about Apollo or GraphQL queries.
|
|
7
|
+
*
|
|
8
|
+
* The three-arm return contract (`ok` / `no_match` / `unsatisfiable`) is
|
|
9
|
+
* documented on `ResolveTagNamesResult` below — callers MUST switch on
|
|
10
|
+
* `kind` before touching the resolved arms.
|
|
11
|
+
*/
|
|
12
|
+
export interface ResolveTagNamesInput<Row extends {
|
|
13
|
+
id: string;
|
|
14
|
+
name: string;
|
|
15
|
+
}> {
|
|
16
|
+
/** All tag rows fetched from the API (any shape that has at least id+name). */
|
|
17
|
+
allTags: Row[];
|
|
18
|
+
/** Names supplied by the caller (case-insensitive match against `allTags[].name`). */
|
|
19
|
+
requestedNames: string[];
|
|
20
|
+
/** Multi-tag semantics — only affects the `unsatisfiable` discriminant for unknown tags. */
|
|
21
|
+
match: TagMatch;
|
|
22
|
+
}
|
|
23
|
+
/**
|
|
24
|
+
* Discriminated union over the three terminal states.
|
|
25
|
+
*
|
|
26
|
+
* Callers branch on `kind` first; the type structurally prevents reading
|
|
27
|
+
* `resolvedRows` on a non-`ok` branch, where the resolved subset must NOT
|
|
28
|
+
* be used (it would silently broaden a `match='all'` query to `match='any'`
|
|
29
|
+
* semantics, or hide an all-unknown input behind a misleading "partial
|
|
30
|
+
* resolution" path).
|
|
31
|
+
*
|
|
32
|
+
* - `ok` — at least one requested name resolved; safe to continue with the
|
|
33
|
+
* subset. Under `match='all'` this implies every name resolved.
|
|
34
|
+
* - `no_match` — every requested name was unknown. Distinct from
|
|
35
|
+
* `unsatisfiable` because the right diagnostic is "no matching tags
|
|
36
|
+
* found" rather than "cannot satisfy AND" (with one input there's no AND
|
|
37
|
+
* to satisfy).
|
|
38
|
+
* - `unsatisfiable` — `match='all'` with at least one resolved AND at
|
|
39
|
+
* least one unknown. Asking for the AND is impossible; the resolved
|
|
40
|
+
* subset is intentionally hidden so a caller can't accidentally fall
|
|
41
|
+
* back to `match='any'` semantics.
|
|
42
|
+
*/
|
|
43
|
+
export type ResolveTagNamesResult<Row extends {
|
|
44
|
+
id: string;
|
|
45
|
+
name: string;
|
|
46
|
+
}> = {
|
|
47
|
+
kind: "ok";
|
|
48
|
+
/** Tag rows whose names matched — preserves the input row shape. */
|
|
49
|
+
resolvedRows: Row[];
|
|
50
|
+
/** Resolved tag IDs in the same order as `resolvedRows`. */
|
|
51
|
+
resolvedIds: TagId[];
|
|
52
|
+
/** Names from the input that did not match any tag. */
|
|
53
|
+
unknownNames: TagName[];
|
|
54
|
+
/**
|
|
55
|
+
* Number of malformed rows skipped by the defensive guard (missing or
|
|
56
|
+
* empty `id` / `name`, or canonical-name duplicates). Non-zero values
|
|
57
|
+
* indicate an upstream contract violation that callers should surface
|
|
58
|
+
* as a `malformed_tag_rows` diagnostic — silent filtering would
|
|
59
|
+
* otherwise hide the breakage.
|
|
60
|
+
*/
|
|
61
|
+
droppedRowCount: number;
|
|
62
|
+
/**
|
|
63
|
+
* Up to ~5 representative names from the dropped rows (where the
|
|
64
|
+
* name was usable). Primarily useful for the duplicate-canonical
|
|
65
|
+
* case so operators can see which names collided.
|
|
66
|
+
*/
|
|
67
|
+
droppedSampleNames: string[];
|
|
68
|
+
} | {
|
|
69
|
+
kind: "no_match";
|
|
70
|
+
/** Every requested name, in input order. */
|
|
71
|
+
unknownNames: TagName[];
|
|
72
|
+
/** Same semantics as the `ok` variant — surface as a diagnostic if non-zero. */
|
|
73
|
+
droppedRowCount: number;
|
|
74
|
+
droppedSampleNames: string[];
|
|
75
|
+
} | {
|
|
76
|
+
kind: "unsatisfiable";
|
|
77
|
+
/** The unknown subset that prevents satisfying `match='all'`. */
|
|
78
|
+
unknownNames: TagName[];
|
|
79
|
+
/** The resolved subset, hidden from callers so they can't broaden semantics. */
|
|
80
|
+
partialResolvedCount: number;
|
|
81
|
+
/** Same semantics as the `ok` variant — surface as a diagnostic if non-zero. */
|
|
82
|
+
droppedRowCount: number;
|
|
83
|
+
droppedSampleNames: string[];
|
|
84
|
+
};
|
|
85
|
+
export declare function resolveTagNames<Row extends {
|
|
86
|
+
id: string;
|
|
87
|
+
name: string;
|
|
88
|
+
}>(input: ResolveTagNamesInput<Row>): ResolveTagNamesResult<Row>;
|
|
89
|
+
/**
|
|
90
|
+
* Filter a tagged-entity ref list to only entries with a usable `id`, and
|
|
91
|
+
* drop the optional `name` when upstream omits it. Used by both
|
|
92
|
+
* `butlr_list_tags` (`applied_to_entities` projection) and
|
|
93
|
+
* `butlr_list_topology` (`collectDirectTaggedIds` + `collectMatchAwareClosure`) so the
|
|
94
|
+
* "what counts as a non-dangling ref" predicate lives in one place — they
|
|
95
|
+
* cannot drift apart, and the count + entity arrays produced from the same
|
|
96
|
+
* filtered list are guaranteed to agree.
|
|
97
|
+
*/
|
|
98
|
+
export declare function projectValidRefs(refs: ReadonlyArray<TaggedEntityRef> | null | undefined): TaggedEntityRef[];
|
|
99
|
+
//# sourceMappingURL=tag-resolver.d.ts.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"tag-resolver.d.ts","sourceRoot":"","sources":["../../src/utils/tag-resolver.ts"],"names":[],"mappings":"AAAA,OAAO,EAGL,KAAK,KAAK,EACV,KAAK,QAAQ,EACb,KAAK,OAAO,EACZ,KAAK,eAAe,EACrB,MAAM,4BAA4B,CAAC;AAEpC;;;;;;;;;GASG;AAEH,MAAM,WAAW,oBAAoB,CAAC,GAAG,SAAS;IAAE,EAAE,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAA;CAAE;IAC5E,+EAA+E;IAC/E,OAAO,EAAE,GAAG,EAAE,CAAC;IACf,sFAAsF;IACtF,cAAc,EAAE,MAAM,EAAE,CAAC;IACzB,4FAA4F;IAC5F,KAAK,EAAE,QAAQ,CAAC;CACjB;AAED;;;;;;;;;;;;;;;;;;;GAmBG;AACH,MAAM,MAAM,qBAAqB,CAAC,GAAG,SAAS;IAAE,EAAE,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAA;CAAE,IACtE;IACE,IAAI,EAAE,IAAI,CAAC;IACX,oEAAoE;IACpE,YAAY,EAAE,GAAG,EAAE,CAAC;IACpB,4DAA4D;IAC5D,WAAW,EAAE,KAAK,EAAE,CAAC;IACrB,uDAAuD;IACvD,YAAY,EAAE,OAAO,EAAE,CAAC;IACxB;;;;;;OAMG;IACH,eAAe,EAAE,MAAM,CAAC;IACxB;;;;OAIG;IACH,kBAAkB,EAAE,MAAM,EAAE,CAAC;CAC9B,GACD;IACE,IAAI,EAAE,UAAU,CAAC;IACjB,4CAA4C;IAC5C,YAAY,EAAE,OAAO,EAAE,CAAC;IACxB,gFAAgF;IAChF,eAAe,EAAE,MAAM,CAAC;IACxB,kBAAkB,EAAE,MAAM,EAAE,CAAC;CAC9B,GACD;IACE,IAAI,EAAE,eAAe,CAAC;IACtB,iEAAiE;IACjE,YAAY,EAAE,OAAO,EAAE,CAAC;IACxB,gFAAgF;IAChF,oBAAoB,EAAE,MAAM,CAAC;IAC7B,gFAAgF;IAChF,eAAe,EAAE,MAAM,CAAC;IACxB,kBAAkB,EAAE,MAAM,EAAE,CAAC;CAC9B,CAAC;AAEN,wBAAgB,eAAe,CAAC,GAAG,SAAS;IAAE,EAAE,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAA;CAAE,EACtE,KAAK,EAAE,oBAAoB,CAAC,GAAG,CAAC,GAC/B,qBAAqB,CAAC,GAAG,CAAC,CA8F5B;AAED;;;;;;;;GAQG;AACH,wBAAgB,gBAAgB,CAC9B,IAAI,EAAE,aAAa,CAAC,eAAe,CAAC,GAAG,IAAI,GAAG,SAAS,GACtD,eAAe,EAAE,CAOnB"}
|
|
@@ -0,0 +1,108 @@
|
|
|
1
|
+
import { asTagId, asTagName, } from "../clients/queries/tags.js";
|
|
2
|
+
export function resolveTagNames(input) {
|
|
3
|
+
const { allTags, requestedNames, match } = input;
|
|
4
|
+
// Defensively skip rows whose `name` or `id` is not a usable string. The
|
|
5
|
+
// type contract says both are required, but a missing field on a partial
|
|
6
|
+
// GraphQL response would otherwise throw on `.toLowerCase()` (name) or
|
|
7
|
+
// surface a null branded TagId downstream (id), crashing every tag-using
|
|
8
|
+
// tool. Empty strings are rejected too — they can never match a
|
|
9
|
+
// Zod-validated request and would sit as dead weight in the lookup.
|
|
10
|
+
// The dropped count is returned to the caller so the upstream contract
|
|
11
|
+
// violation is visible (rather than silently masking it as "unknown tag").
|
|
12
|
+
const lookup = new Map();
|
|
13
|
+
let droppedRowCount = 0;
|
|
14
|
+
const droppedSampleNames = [];
|
|
15
|
+
const SAMPLE_LIMIT = 5;
|
|
16
|
+
const noteDroppedName = (name) => {
|
|
17
|
+
if (typeof name === "string" &&
|
|
18
|
+
name.trim().length > 0 &&
|
|
19
|
+
droppedSampleNames.length < SAMPLE_LIMIT) {
|
|
20
|
+
droppedSampleNames.push(name);
|
|
21
|
+
}
|
|
22
|
+
};
|
|
23
|
+
for (const t of allTags) {
|
|
24
|
+
// Whitespace-only counts as "missing" — asTagId / asTagName would
|
|
25
|
+
// reject it later, but the boundary check is the right place for
|
|
26
|
+
// the user-facing diagnostic to fire from.
|
|
27
|
+
if (typeof t.name !== "string" || t.name.trim().length === 0) {
|
|
28
|
+
droppedRowCount++;
|
|
29
|
+
// No usable name to sample — diagnostic carries count only.
|
|
30
|
+
continue;
|
|
31
|
+
}
|
|
32
|
+
if (typeof t.id !== "string" || t.id.trim().length === 0) {
|
|
33
|
+
droppedRowCount++;
|
|
34
|
+
noteDroppedName(t.name);
|
|
35
|
+
continue;
|
|
36
|
+
}
|
|
37
|
+
const key = t.name.toLowerCase();
|
|
38
|
+
// First-write-wins on duplicate canonical names. If upstream returns
|
|
39
|
+
// two rows with case-insensitively equal names (e.g. "Huddle" and
|
|
40
|
+
// "huddle"), last-write would non-deterministically depend on
|
|
41
|
+
// upstream order and silently mask the upstream-contract violation.
|
|
42
|
+
// Treating the dup as a malformed row keeps resolution deterministic
|
|
43
|
+
// and surfaces the issue via the same droppedRowCount → malformed_tag_rows
|
|
44
|
+
// diagnostic that catches null/empty rows.
|
|
45
|
+
if (lookup.has(key)) {
|
|
46
|
+
droppedRowCount++;
|
|
47
|
+
noteDroppedName(t.name);
|
|
48
|
+
continue;
|
|
49
|
+
}
|
|
50
|
+
lookup.set(key, t);
|
|
51
|
+
}
|
|
52
|
+
const resolvedRows = [];
|
|
53
|
+
const resolvedIds = [];
|
|
54
|
+
const unknownNames = [];
|
|
55
|
+
for (const rawName of requestedNames) {
|
|
56
|
+
const name = asTagName(rawName);
|
|
57
|
+
const row = lookup.get(name.toLowerCase());
|
|
58
|
+
if (row) {
|
|
59
|
+
resolvedRows.push(row);
|
|
60
|
+
resolvedIds.push(asTagId(row.id));
|
|
61
|
+
}
|
|
62
|
+
else {
|
|
63
|
+
unknownNames.push(name);
|
|
64
|
+
}
|
|
65
|
+
}
|
|
66
|
+
if (resolvedRows.length === 0 && unknownNames.length > 0) {
|
|
67
|
+
// At least one name was requested and nothing matched — distinct from
|
|
68
|
+
// `unsatisfiable` so callers can emit "no matching tags found" rather
|
|
69
|
+
// than the misleading "cannot satisfy AND" (when only one input was
|
|
70
|
+
// sent there's no AND to fail). Empty `requestedNames` falls through
|
|
71
|
+
// to the `ok` branch as a trivially-empty resolution.
|
|
72
|
+
return { kind: "no_match", unknownNames, droppedRowCount, droppedSampleNames };
|
|
73
|
+
}
|
|
74
|
+
if (match === "all" && unknownNames.length > 0) {
|
|
75
|
+
return {
|
|
76
|
+
kind: "unsatisfiable",
|
|
77
|
+
unknownNames,
|
|
78
|
+
partialResolvedCount: resolvedRows.length,
|
|
79
|
+
droppedRowCount,
|
|
80
|
+
droppedSampleNames,
|
|
81
|
+
};
|
|
82
|
+
}
|
|
83
|
+
return {
|
|
84
|
+
kind: "ok",
|
|
85
|
+
resolvedRows,
|
|
86
|
+
resolvedIds,
|
|
87
|
+
unknownNames,
|
|
88
|
+
droppedRowCount,
|
|
89
|
+
droppedSampleNames,
|
|
90
|
+
};
|
|
91
|
+
}
|
|
92
|
+
/**
|
|
93
|
+
* Filter a tagged-entity ref list to only entries with a usable `id`, and
|
|
94
|
+
* drop the optional `name` when upstream omits it. Used by both
|
|
95
|
+
* `butlr_list_tags` (`applied_to_entities` projection) and
|
|
96
|
+
* `butlr_list_topology` (`collectDirectTaggedIds` + `collectMatchAwareClosure`) so the
|
|
97
|
+
* "what counts as a non-dangling ref" predicate lives in one place — they
|
|
98
|
+
* cannot drift apart, and the count + entity arrays produced from the same
|
|
99
|
+
* filtered list are guaranteed to agree.
|
|
100
|
+
*/
|
|
101
|
+
export function projectValidRefs(refs) {
|
|
102
|
+
if (!refs)
|
|
103
|
+
return [];
|
|
104
|
+
return refs.flatMap((ref) => typeof ref.id === "string" && ref.id.trim().length > 0
|
|
105
|
+
? [typeof ref.name === "string" ? { id: ref.id, name: ref.name } : { id: ref.id }]
|
|
106
|
+
: []);
|
|
107
|
+
}
|
|
108
|
+
//# sourceMappingURL=tag-resolver.js.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"tag-resolver.js","sourceRoot":"","sources":["../../src/utils/tag-resolver.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,OAAO,EACP,SAAS,GAKV,MAAM,4BAA4B,CAAC;AAqFpC,MAAM,UAAU,eAAe,CAC7B,KAAgC;IAEhC,MAAM,EAAE,OAAO,EAAE,cAAc,EAAE,KAAK,EAAE,GAAG,KAAK,CAAC;IAEjD,yEAAyE;IACzE,yEAAyE;IACzE,uEAAuE;IACvE,yEAAyE;IACzE,gEAAgE;IAChE,oEAAoE;IACpE,uEAAuE;IACvE,2EAA2E;IAC3E,MAAM,MAAM,GAAG,IAAI,GAAG,EAAe,CAAC;IACtC,IAAI,eAAe,GAAG,CAAC,CAAC;IACxB,MAAM,kBAAkB,GAAa,EAAE,CAAC;IACxC,MAAM,YAAY,GAAG,CAAC,CAAC;IACvB,MAAM,eAAe,GAAG,CAAC,IAAa,EAAQ,EAAE;QAC9C,IACE,OAAO,IAAI,KAAK,QAAQ;YACxB,IAAI,CAAC,IAAI,EAAE,CAAC,MAAM,GAAG,CAAC;YACtB,kBAAkB,CAAC,MAAM,GAAG,YAAY,EACxC,CAAC;YACD,kBAAkB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAChC,CAAC;IACH,CAAC,CAAC;IACF,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QACxB,kEAAkE;QAClE,iEAAiE;QACjE,2CAA2C;QAC3C,IAAI,OAAO,CAAC,CAAC,IAAI,KAAK,QAAQ,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC7D,eAAe,EAAE,CAAC;YAClB,4DAA4D;YAC5D,SAAS;QACX,CAAC;QACD,IAAI,OAAO,CAAC,CAAC,EAAE,KAAK,QAAQ,IAAI,CAAC,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACzD,eAAe,EAAE,CAAC;YAClB,eAAe,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YACxB,SAAS;QACX,CAAC;QACD,MAAM,GAAG,GAAG,CAAC,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC;QACjC,qEAAqE;QACrE,kEAAkE;QAClE,8DAA8D;QAC9D,oEAAoE;QACpE,qEAAqE;QACrE,2EAA2E;QAC3E,2CAA2C;QAC3C,IAAI,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YACpB,eAAe,EAAE,CAAC;YAClB,eAAe,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YACxB,SAAS;QACX,CAAC;QACD,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IACrB,CAAC;IAED,MAAM,YAAY,GAAU,EAAE,CAAC;IAC/B,MAAM,WAAW,GAAY,EAAE,CAAC;IAChC,MAAM,YAAY,GAAc,EAAE,CAAC;IAEnC,KAAK,MAAM,OAAO,IAAI,cAAc,EAAE,CAAC;QACrC,MAAM,IAAI,GAAG,SAAS,CAAC,OAAO,CAAC,CAAC;QAChC,MAAM,GAAG,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,CAAC;QAC3C,IAAI,GAAG,EAAE,CAAC;YACR,YAAY,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACvB,WAAW,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;QACpC,CAAC;aAAM,CAAC;YACN,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC1B,CAAC;IACH,CAAC;IAED,IAAI,YAAY,CAAC,MAAM,KAAK,CAAC,IAAI,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACzD,sEAAsE;QACtE,sEAAsE;QACtE,oEAAoE;QACpE,qEAAqE;QACrE,sDAAsD;QACtD,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,YAAY,EAAE,eAAe,EAAE,kBAAkB,EAAE,CAAC;IACjF,CAAC;IACD,IAAI,KAAK,KAAK,KAAK,IAAI,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC/C,OAAO;YACL,IAAI,EAAE,eAAe;YACrB,YAAY;YACZ,oBAAoB,EAAE,YAAY,CAAC,MAAM;YACzC,eAAe;YACf,kBAAkB;SACnB,CAAC;IACJ,CAAC;IACD,OAAO;QACL,IAAI,EAAE,IAAI;QACV,YAAY;QACZ,WAAW;QACX,YAAY;QACZ,eAAe;QACf,kBAAkB;KACnB,CAAC;AACJ,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,gBAAgB,CAC9B,IAAuD;IAEvD,IAAI,CAAC,IAAI;QAAE,OAAO,EAAE,CAAC;IACrB,OAAO,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,EAAE,CAC1B,OAAO,GAAG,CAAC,EAAE,KAAK,QAAQ,IAAI,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,MAAM,GAAG,CAAC;QACpD,CAAC,CAAC,CAAC,OAAO,GAAG,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,CAAC;QAClF,CAAC,CAAC,EAAE,CACP,CAAC;AACJ,CAAC"}
|
package/package.json
CHANGED