npm - @macrostrat/feedback-components - Versions diffs - 1.1.0 → 1.1.1 - Mend

@macrostrat/feedback-components 1.1.0 → 1.1.1

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.

Files changed (58) hide show

package/dist/node/feedback-components.e2f3c4b7.js.map DELETED Viewed

@@ -1 +0,0 @@

- {"mappings":"A,O,c,C,C,iB,C,C,c,C,K,O,A,Q,M,qB,CCKO,IAAK,EAAA,G,CAAA,E,C,G,I,C,O,E,K,C,QAAA,GAgDL,SAAS,EACd,CAAuB,CACvB,CAAoC,EAIpC,IAAM,EAAO,EAAY,MAAM,GAAG,IAAI,GAAG,KAAK,CAE9C,OAAO,AAAA,EAAW,EAAa,CAC7B,YAAA,EACA,KAAM,EACN,cAAe,EAAE,CACjB,eAAgB,EAChB,mBAAoB,EACpB,eAAgB,EAChB,sBAAuB,CAAA,EACvB,SAAA,MACF,EACF,CAEO,IAAM,EAAsB,AAAA,EAAmC,MAE/D,SAAS,IACd,IAAM,EAAW,AAAA,EAAW,GAC5B,GAAI,AAAY,MAAZ,EACF,MAAM,AAAI,MAAM,iCAElB,OAAO,CACT,CAEA,SAAS,EAAY,CAAgB,CAAE,CAAkB,EACvD,OAAQ,EAAO,IAAI,EACjB,IAAK,kBAAmB,CAEtB,GAAM,CAAA,KAAE,CAAI,CAAA,YAAE,CAAW,CAAA,MAAE,CAAK,CAAE,CAAG,EAAO,OAAO,CAC7C,EAAQ,EAAM,cAAc,CAAG,EAC/B,EAAsB,CAC1B,GAAI,EACJ,KAAA,EACA,YAAa,AAAgB,KAAhB,EAAqB,KAAO,EACzC,MAAA,CACF,EAEM,EAAoB,IAAI,IAAI,EAAM,cAAc,EAGtD,OAFA,EAAkB,GAAG,CAAC,EAAO,GAEtB,CACL,GAAG,CAAK,CACR,eAAgB,EAChB,mBAAoB,EACpB,eAAgB,CAClB,CACF,CACA,IAAK,qBAAsB,CAEzB,GAAM,CAAA,GAAE,CAAE,CAAA,KAAE,CAAI,CAAA,YAAE,CAAW,CAAA,MAAE,CAAK,CAAE,CAAG,EAAO,OAAO,CACjD,EAAoB,IAAI,IAAI,EAAM,cAAc,EAChD,EAAU,EAAkB,GAAG,CAAC,GAEtC,GAAI,CAAC,EAEH,OADA,QAAQ,IAAI,CAAC,CAAC,oBAAoB,EAAE,EAAG,UAAU,CAAC,EAC3C,EAGT,IAAM,EAA0B,CAC9B,GAAG,CAAO,CACV,KAAA,EACA,YAAa,AAAgB,KAAhB,EAAqB,KAAO,EACzC,MAAA,CACF,EAEA,EAAkB,GAAG,CAAC,EAAI,GAG1B,IAAM,EAAU,EAAgB,EAAM,IAAI,CAAE,EAAS,GAErD,MAAO,CACL,GAAG,CAAK,CACR,KAAM,EACN,eAAgB,EAChB,mBAAoB,CACtB,CACF,CACA,IAAK,YAEH,GAAM,CAAC,EAAS,EAAa,CAAG,EAC9B,EAAM,IAAI,CACV,EAAO,OAAO,CAAC,OAAO,EAGpB,EAAmC,EAAE,AACrC,CAAA,EAAO,OAAO,CAAC,QAAQ,EAEzB,AADA,CAAA,EAAU,EAAS,EAAS,EAAO,OAAO,CAAC,QAAQ,CAAA,EAC3C,IAAI,CAAC,YAIf,IAAI,EAAa,EAAgB,EAAS,CACxC,QAAS,CAAC,CAAC,EAAO,OAAO,CAAC,KAAK,CAAE,KAAM,EAAa,CAAC,AACvD,GAEA,MAAO,CAAE,GAAG,CAAK,CAAE,KAAM,AAAA,EAAO,EAAS,EAAY,CACvD,KAAK,cAEH,GAAM,CAAC,EAAU,EAAc,CAAG,EAChC,EAAM,IAAI,CACV,EAAO,OAAO,CAAC,GAAG,EAKd,EAAW,EACd,OAAO,CAAC,AAAC,GAAS,EAAK,QAAQ,EAAI,EAAE,EACrC,MAAM,CAAC,AAAC,GAAU,CAAC,AAmH5B,SAAS,EAAa,CAAgB,CAAE,CAAU,EAChD,IAAK,IAAI,KAAQ,EACf,GAAI,EAAK,EAAE,EAAI,EACb,MAAO,CAAA,OACF,GAAI,EAAK,QAAQ,EAClB,EAAa,EAAK,QAAQ,CAAE,GAC9B,MAAO,CAAA,EAIb,MAAO,CAAA,CACT,EA9HyC,EAAU,EAAM,EAAE,GAIrD,MAAO,CACL,GAAG,CAAK,CACR,KAAM,IAAI,KAAa,EAAS,CAChC,cAAe,EAAM,aAAa,CAAC,MAAM,CACvC,AAAC,GAAO,CAAC,EAAO,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,GAEzC,CACF,KAAK,cACH,GAAM,CAAA,IAAE,CAAG,CAAE,CAAG,EAAO,OAAO,CAExB,EACJ,EAAO,OAAO,CAAC,GAAG,CAAC,MAAM,CAAG,EACxB,EAAa,EAAM,IAAI,CAAE,CAAG,CAAC,EAAE,GAAG,KAClC,KAIN,OAFA,QAAQ,GAAG,CAAC,mBAAoB,EAAK,QAAS,GAEvC,CAAE,GAAG,CAAK,CAAE,cAAe,EAAK,mBAAoB,CAAK,CAElE,KAAK,uBACH,IAAM,EAAa,EAAO,OAAO,CAAC,GAAG,CAAC,MAAM,CAC1C,AAAC,GAAO,CAAC,EAAM,aAAa,CAAC,QAAQ,CAAC,IAElC,EAAc,EAAM,aAAa,CAAC,MAAM,CAC5C,AAAC,GAAO,CAAC,EAAO,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,IAGjC,EACJ,EAAO,OAAO,CAAC,GAAG,CAAC,MAAM,CAAG,EACxB,EAAa,EAAM,IAAI,CAAE,EAAO,OAAO,CAAC,GAAG,CAAC,EAAE,GAAG,KACjD,KAEN,MAAO,CACL,GAAG,CAAK,CACR,cAAe,IAAI,KAAgB,EAAW,CAC9C,mBAAoB,CACtB,CAEF,KAAK,cACH,IAAM,EAAQ,EAAM,cAAc,CAAG,EAC/B,CAAA,KAAE,CAAI,CAAA,MAAE,CAAK,CAAA,IAAE,CAAG,CAAE,CAAG,EAAO,OAAO,CACrC,EAAiB,CACrB,GAAI,EACJ,KAAM,EACN,SAAU,EAAE,CACZ,QAAS,CAAC,EAAO,EAAI,CACrB,KAAM,EAAM,kBAAkB,AAChC,EAEA,MAAO,CACL,GAAG,CAAK,CACR,KAAM,IAAI,EAAM,IAAI,CAAE,EAAK,CAC3B,cAAe,CAAC,EAAM,CACtB,eAAgB,CAClB,CAEF,KAAK,qBAAsB,CAEzB,QAAQ,GAAG,CAAC,wBAAyB,EAAO,OAAO,CAAC,EAAE,EACtD,GAAM,CAAA,GAAE,CAAE,CAAE,CAAG,EAAO,OAAO,CACvB,EAAoB,IAAI,IAAI,EAAM,cAAc,EAChD,EAAU,EAAkB,GAAG,CAAC,GACtC,EAAkB,MAAM,CAAC,GAEzB,IAAM,EAAc,EAAkB,MAAM,GAAG,IAAI,GAAG,KAAK,CACrD,EAAU,EAAgB,EAAM,IAAI,CAAE,EAAS,GAErD,MAAO,CACL,GAAG,CAAK,CACR,KAAM,EACN,eAAgB,EAChB,cAAe,EAAE,AACnB,CACF,CAGA,IAAK,8BACH,MAAO,CACL,GAAG,CAAK,CACR,sBAAuB,EAAO,OAAO,EAAI,CAAC,EAAM,qBAAqB,AACvE,CACF,KAAK,qBAAsB,CAEzB,IAAI,EAAW,EAAM,IAAI,CACzB,IAAK,IAAI,KAAM,EAAM,aAAa,CAKhC,EAAW,AAAA,EAAO,EAHC,EADH,EAAS,EAAM,IAAI,CAAE,GACO,CAC1C,KAAM,CAAE,KAAM,EAAO,OAAO,AAAC,CAC/B,IAIF,MAAO,CACL,GAAG,CAAK,CACR,KAAM,EACN,mBAAoB,EAAO,OAAO,AACpC,CACF,CACA,IAAK,WACH,MAAO,CAAE,GAAG,CAAK,CAAE,cAAe,EAAE,AAAC,CACvC,KAAK,QACH,MAAO,CACL,GAAG,CAAK,CACR,KAAM,EAAM,WAAW,CACvB,cAAe,EAAE,AACnB,CACF,KAAK,gBACH,MAAO,CAAE,GAAG,CAAK,CAAE,SAAU,EAAO,OAAO,AAAC,CAChD,CACF,CAeA,SAAS,EACP,CAAgC,CAChC,CAAoB,EAIpB,IAAI,EAAO,EACX,IAAK,IAAI,EAAI,EAAQ,MAAM,CAAG,EAAG,GAAK,EAAG,IACvC,EAAO,CAAE,CAAC,CAAO,CAAC,EAAE,CAAC,CAAE,CAAK,EAE9B,OAAO,CAET,CAEA,SAAS,EACP,CAAgB,CAChB,CAAU,EAGV,IAAK,IAAI,EAAI,EAAG,EAAI,EAAK,MAAM,CAAE,IAC/B,GAAI,CAAI,CAAC,EAAE,CAAC,EAAE,EAAI,EAChB,MAAO,CAAC,EAAE,MACL,GAAI,CAAI,CAAC,EAAE,CAAC,QAAQ,CAAE,CAC3B,IAAI,EAAO,EAAS,CAAI,CAAC,EAAE,CAAC,QAAQ,CAAE,GACtC,GAAI,AAAQ,MAAR,EACF,MAAO,CAAC,EAAG,cAAe,EAAK,AAEnC,CAEF,OAAO,IACT,CAEA,SAAS,EACP,CAAgB,CAChB,CAAa,EAGb,IAAI,EAAsB,EAAE,CACxB,EAA2B,EAAE,CAEjC,IAAK,IAAI,KAAQ,EACf,GAAI,EAAI,QAAQ,CAAC,EAAK,EAAE,EACtB,EAAa,IAAI,CAAC,OACb,CAEL,GAAI,EAAK,QAAQ,CAAE,CACjB,GAAI,CAAC,EAAa,EAAgB,CAAG,EAAY,EAAK,QAAQ,CAAE,GAChE,EAAO,CAAE,GAAG,CAAI,CAAE,SAAU,CAAY,EACxC,EAAa,IAAI,IAAI,EACvB,CACA,EAAQ,IAAI,CAAC,EACf,CAGF,MAAO,CAAC,EAAS,EAAa,AAChC,CAkBO,SAAS,EAAY,CAAgB,EAE1C,IAAI,EAAwB,EAAE,CAC1B,EAA4C,EAAE,CAC5C,EAAU,IAAI,IAEpB,IAAK,IAAI,KAAQ,EAAM,CAGrB,GAAI,EAAQ,GAAG,CAAC,EAAK,EAAE,EACrB,SAGF,GAAM,CAAA,QAAE,CAAO,CAAA,GAAE,CAAE,CAAA,KAAE,CAAI,CAAA,KAAE,CAAI,CAAA,SAAE,CAAQ,CAAE,CAAG,EAExC,EAAyB,CAC7B,GAAA,EACA,KAAM,EAAK,EAAE,CACb,MAAO,EAAK,KAAK,CACjB,KAAA,EACA,UAAW,CAAC,EAAQ,CACpB,UAAW,KACX,MAAO,EAAK,KAAK,CACjB,SAAA,CACF,EAKA,GAHA,EAAQ,GAAG,CAAC,EAAK,EAAE,CAAE,GACrB,EAAM,IAAI,CAAC,GAEP,EAAK,QAAQ,CAAE,CACjB,IAAK,IAAI,KAAS,EAAK,QAAQ,CAC7B,EAAM,IAAI,CAAC,CAAE,OAAQ,EAAK,EAAE,CAAE,KAAM,EAAM,EAAE,AAAC,GAI/C,GAAM,CAAE,MAAO,CAAU,CAAE,MAAO,CAAU,CAAE,CAAG,EAC/C,EAAK,QAAQ,EAEf,EAAM,IAAI,IAAI,GACd,EAAM,IAAI,IAAI,EAChB,CACF,CAEA,MAAO,CAAE,MAAA,EAAO,MAAA,CAAM,CACxB,CAEA,SAAS,EAAa,CAAI,CAAE,CAAE,EAC5B,IAAK,IAAM,KAAQ,EAAM,CACvB,GAAI,EAAK,EAAE,GAAK,EACd,OAAO,EAET,GAAI,EAAK,QAAQ,CAAE,CACjB,IAAM,EAAQ,EAAa,EAAK,QAAQ,CAAE,GAC1C,GAAI,EAAO,OAAO,CACpB,CACF,CACA,OAAO,IACT,CAEA,SAAS,EAAgB,CAAI,CAAE,CAAO,CAAE,CAAW,EACjD,OAAO,EAAK,GAAG,CAAC,AAAC,GAAS,AAG5B,CAAA,SAAwB,CAAI,CAAE,CAAO,CAAE,CAAW,EAChD,IAAM,EAAO,EAAK,IAAI,CAAC,EAAE,GAAK,EAAQ,EAAE,CAAG,EAAc,EAAK,IAAI,CAElE,MAAO,CACL,GAAG,CAAI,CACP,KAAA,EACA,SAAU,EAAK,QAAQ,CACnB,EAAgB,EAAK,QAAQ,CAAE,EAAS,GACxC,EAAE,AACR,CACF,CAAA,EAb2C,EAAM,EAAS,GAC1D,Q,K,Q,C,K,gB,C,K,mB,C,K,e,C,K,W","sources":["<anon>","packages/feedback-components/src/feedback/edit-state.ts"],"sourcesContent":["import {useReducer as $eGztG$useReducer, createContext as $eGztG$createContext, useContext as $eGztG$useContext} from \"react\";\nimport $eGztG$immutabilityhelper from \"immutability-helper\";\n\n\n\nvar $330ae695507d96f5$export$53ec42062883b2d4 = /*#__PURE__*/ function(ViewMode) {\n ViewMode[\"Tree\"] = \"tree\";\n ViewMode[\"Graph\"] = \"graph\";\n return ViewMode;\n}({});\nfunction $330ae695507d96f5$export$911bb4b9c8065d3d(initialTree, entityTypes) {\n // Get the first entity type\n // issue: grabs second entity instead of selected one\n const type = entityTypes.values().next().value;\n return (0, $eGztG$useReducer)($330ae695507d96f5$var$treeReducer, {\n initialTree: initialTree,\n tree: initialTree,\n selectedNodes: [],\n entityTypesMap: entityTypes,\n selectedEntityType: type,\n lastInternalId: 0,\n isSelectingEntityType: false,\n viewMode: \"tree\"\n });\n}\nconst $330ae695507d96f5$export$e5ce04c5b3f58533 = (0, $eGztG$createContext)(null);\nfunction $330ae695507d96f5$export$e1068f2d1c68f87e() {\n const dispatch = (0, $eGztG$useContext)($330ae695507d96f5$export$e5ce04c5b3f58533);\n if (dispatch == null) throw new Error(\"No dispatch context available\");\n return dispatch;\n}\nfunction $330ae695507d96f5$var$treeReducer(state, action) {\n switch(action.type){\n case \"add-entity-type\":\n {\n // Add a new entity type to the map\n const { name: name, description: description, color: color } = action.payload;\n const newId = state.lastInternalId - 1;\n const newType = {\n id: newId,\n name: name,\n description: description === \"\" ? null : description,\n color: color\n };\n const newEntityTypesMap = new Map(state.entityTypesMap);\n newEntityTypesMap.set(newId, newType);\n return {\n ...state,\n entityTypesMap: newEntityTypesMap,\n selectedEntityType: newType,\n lastInternalId: newId\n };\n }\n case \"update-entity-type\":\n {\n // Update an existing entity type in the map\n const { id: id, name: name, description: description, color: color } = action.payload;\n const newEntityTypesMap = new Map(state.entityTypesMap);\n const oldType = newEntityTypesMap.get(id);\n if (!oldType) {\n console.warn(`Entity type with id ${id} not found`);\n return state;\n }\n const updatedType = {\n ...oldType,\n name: name,\n description: description === \"\" ? null : description,\n color: color\n };\n newEntityTypesMap.set(id, updatedType);\n // Update the tree to reflect the new type\n const newTree = $330ae695507d96f5$var$updateTreeTypes(state.tree, oldType, updatedType);\n return {\n ...state,\n tree: newTree,\n entityTypesMap: newEntityTypesMap,\n selectedEntityType: updatedType\n };\n }\n case \"move-node\":\n // For each node in the tree, if the node is in the dragIds, remove it from the tree and collect it\n const [newTree, removedNodes] = $330ae695507d96f5$var$removeNodes(state.tree, action.payload.dragIds);\n let keyPath = [];\n if (action.payload.parentId) {\n keyPath = $330ae695507d96f5$var$findNode(newTree, action.payload.parentId);\n keyPath.push(\"children\");\n }\n // Add removed nodes to the new tree at the correct location\n let updateSpec = $330ae695507d96f5$var$buildNestedSpec(keyPath, {\n $splice: [\n [\n action.payload.index,\n 0,\n ...removedNodes\n ]\n ]\n });\n return {\n ...state,\n tree: (0, $eGztG$immutabilityhelper)(newTree, updateSpec)\n };\n case \"delete-node\":\n // For each node in the tree, if the node is in the ids, remove it from the tree\n const [newTree2, _removedNodes] = $330ae695507d96f5$var$removeNodes(state.tree, action.payload.ids);\n // Get children of the removed nodes\n // If children are not present elsewhere in the tree, insert them\n const children = _removedNodes.flatMap((node)=>node.children ?? []).filter((child)=>!$330ae695507d96f5$var$nodeIsInTree(newTree2, child.id));\n // Reset the selection\n return {\n ...state,\n tree: [\n ...newTree2,\n ...children\n ],\n selectedNodes: state.selectedNodes.filter((id)=>!action.payload.ids.includes(id))\n };\n case \"select-node\":\n const { ids: ids } = action.payload;\n const type = action.payload.ids.length > 0 ? $330ae695507d96f5$var$findNodeById(state.tree, ids[0])?.type : null;\n console.log(\"Selecting nodes:\", ids, \"Type:\", type);\n return {\n ...state,\n selectedNodes: ids,\n selectedEntityType: type\n };\n // otherwise fall through to toggle-node-selected for a single ID\n case \"toggle-node-selected\":\n const nodesToAdd = action.payload.ids.filter((id)=>!state.selectedNodes.includes(id));\n const nodesToKeep = state.selectedNodes.filter((id)=>!action.payload.ids.includes(id));\n const newType = action.payload.ids.length > 0 ? $330ae695507d96f5$var$findNodeById(state.tree, action.payload.ids[0])?.type : null;\n return {\n ...state,\n selectedNodes: [\n ...nodesToKeep,\n ...nodesToAdd\n ],\n selectedEntityType: newType\n };\n case \"create-node\":\n const newId = state.lastInternalId - 1;\n const { text: text, start: start, end: end } = action.payload;\n const node = {\n id: newId,\n name: text,\n children: [],\n indices: [\n start,\n end\n ],\n type: state.selectedEntityType\n };\n return {\n ...state,\n tree: [\n ...state.tree,\n node\n ],\n selectedNodes: [\n newId\n ],\n lastInternalId: newId\n };\n case \"delete-entity-type\":\n {\n // Remove the entity type from the map\n console.log(\"Deleting entity type:\", action.payload.id);\n const { id: id } = action.payload;\n const newEntityTypesMap = new Map(state.entityTypesMap);\n const oldType = newEntityTypesMap.get(id);\n newEntityTypesMap.delete(id);\n const defaultType = newEntityTypesMap.values().next().value;\n const newTree = $330ae695507d96f5$var$updateTreeTypes(state.tree, oldType, defaultType);\n return {\n ...state,\n tree: newTree,\n entityTypesMap: newEntityTypesMap,\n selectedNodes: []\n };\n }\n /** Entity type selection */ case \"toggle-entity-type-selector\":\n return {\n ...state,\n isSelectingEntityType: action.payload ?? !state.isSelectingEntityType\n };\n case \"select-entity-type\":\n {\n // For each selected node, update the type\n let newTree2 = state.tree;\n for (let id of state.selectedNodes){\n const keyPath = $330ae695507d96f5$var$findNode(state.tree, id);\n const nestedSpec = $330ae695507d96f5$var$buildNestedSpec(keyPath, {\n type: {\n $set: action.payload\n }\n });\n newTree2 = (0, $eGztG$immutabilityhelper)(newTree2, nestedSpec);\n }\n return {\n ...state,\n tree: newTree2,\n selectedEntityType: action.payload\n };\n }\n case \"deselect\":\n return {\n ...state,\n selectedNodes: []\n };\n case \"reset\":\n return {\n ...state,\n tree: state.initialTree,\n selectedNodes: []\n };\n case \"set-view-mode\":\n return {\n ...state,\n viewMode: action.payload\n };\n }\n}\nfunction $330ae695507d96f5$var$nodeIsInTree(tree, id) {\n for (let node of tree){\n if (node.id == id) return true;\n else if (node.children) {\n if ($330ae695507d96f5$var$nodeIsInTree(node.children, id)) return true;\n }\n }\n return false;\n}\nfunction $330ae695507d96f5$var$buildNestedSpec(keyPath, innerSpec) {\n // Build a nested object from a key path\n let spec = innerSpec;\n for(let i = keyPath.length - 1; i >= 0; i--)spec = {\n [keyPath[i]]: spec\n };\n return spec;\n// Since we don't have a \"children\" key at the root, we make the top-level spec an array\n}\nfunction $330ae695507d96f5$var$findNode(tree, id) {\n // Find the index of the node with the given id in the tree, returning the key path\n for(let i = 0; i < tree.length; i++){\n if (tree[i].id == id) return [\n i\n ];\n else if (tree[i].children) {\n let path = $330ae695507d96f5$var$findNode(tree[i].children, id);\n if (path != null) return [\n i,\n \"children\",\n ...path\n ];\n }\n }\n return null;\n}\nfunction $330ae695507d96f5$var$removeNodes(tree, ids) {\n /** Remove nodes with the given ids from the tree and return the new tree and the removed nodes */ let newTree = [];\n let removedNodes = [];\n for (let node of tree)if (ids.includes(node.id)) removedNodes.push(node);\n else {\n // Recurse into children\n if (node.children) {\n let [newChildren, removedChildren] = $330ae695507d96f5$var$removeNodes(node.children, ids);\n node = {\n ...node,\n children: newChildren\n };\n removedNodes.push(...removedChildren);\n }\n newTree.push(node);\n }\n return [\n newTree,\n removedNodes\n ];\n}\nfunction $330ae695507d96f5$export$8d9dbb7a64bf2a5e(tree) {\n // Convert the tree to a graph\n let nodes = [];\n let edges = [];\n const nodeMap = new Map();\n for (let node of tree){\n // If we've already found an instance of this node, we don't need to record\n // it again\n if (nodeMap.has(node.id)) continue;\n const { indices: indices, id: id, name: name, type: type, children: children } = node;\n const nodeData = {\n id: id,\n type: type.id,\n color: type.color,\n name: name,\n txt_range: [\n indices\n ],\n reasoning: null,\n match: node.match,\n children: children\n };\n nodeMap.set(node.id, node);\n nodes.push(nodeData);\n if (node.children) {\n for (let child of node.children)edges.push({\n source: node.id,\n dest: child.id\n });\n // Now process the children\n const { nodes: childNodes, edges: childEdges } = $330ae695507d96f5$export$8d9dbb7a64bf2a5e(node.children);\n nodes.push(...childNodes);\n edges.push(...childEdges);\n }\n }\n return {\n nodes: nodes,\n edges: edges\n };\n}\nfunction $330ae695507d96f5$var$findNodeById(tree, id) {\n for (const node of tree){\n if (node.id === id) return node;\n if (node.children) {\n const found = $330ae695507d96f5$var$findNodeById(node.children, id);\n if (found) return found;\n }\n }\n return null;\n}\nfunction $330ae695507d96f5$var$updateTreeTypes(tree, oldType, defaultType) {\n return tree.map((node)=>$330ae695507d96f5$var$updateNodeType(node, oldType, defaultType));\n}\nfunction $330ae695507d96f5$var$updateNodeType(node, oldType, defaultType) {\n const type = node.type.id === oldType.id ? defaultType : node.type;\n return {\n ...node,\n type: type,\n children: node.children ? $330ae695507d96f5$var$updateTreeTypes(node.children, oldType, defaultType) : []\n };\n}\n\n\nexport {$330ae695507d96f5$export$53ec42062883b2d4 as ViewMode, $330ae695507d96f5$export$911bb4b9c8065d3d as useUpdatableTree, $330ae695507d96f5$export$e5ce04c5b3f58533 as TreeDispatchContext, $330ae695507d96f5$export$e1068f2d1c68f87e as useTreeDispatch, $330ae695507d96f5$export$8d9dbb7a64bf2a5e as treeToGraph};\n//# sourceMappingURL=feedback-components.e2f3c4b7.js.map\n","import { TreeData } from \"./types\";\nimport { createContext, Dispatch, useContext, useReducer } from \"react\";\nimport update, { Spec } from \"immutability-helper\";\nimport { EntityType } from \"../extractions/types\";\n\nexport enum ViewMode {\n Tree = \"tree\",\n Graph = \"graph\",\n}\n\ninterface TreeState {\n initialTree: TreeData[];\n tree: TreeData[];\n selectedNodes: number[];\n entityTypesMap: Map<number, EntityType>;\n selectedEntityType: EntityType;\n lastInternalId: number;\n isSelectingEntityType: boolean;\n viewMode: ViewMode;\n}\n\ntype TextRange = {\n start: number;\n end: number;\n text: string;\n};\n\ntype TreeAction =\n | {\n type: \"move-node\";\n payload: { dragIds: number[]; parentId: number; index: number };\n }\n | { type: \"delete-node\"; payload: { ids: number[] } }\n | { type: \"select-node\"; payload: { ids: number[] } }\n | { type: \"toggle-node-selected\"; payload: { ids: number[] } }\n | { type: \"set-view-mode\"; payload: ViewMode }\n | { type: \"create-node\"; payload: TextRange }\n | { type: \"select-entity-type\"; payload: EntityType }\n | { type: \"toggle-entity-type-selector\"; payload?: boolean | null }\n | { type: \"deselect\" }\n | { type: \"reset\" }\n | { type: \"delete-entity-type\"; payload: { id: number } }\n | {\n type: \"add-entity-type\";\n payload: { name: string; description: string; color: string };\n }\n | {\n type: \"update-entity-type\";\n payload: { id: number; name: string; description: string; color: string };\n };\n\nexport type TreeDispatch = Dispatch<TreeAction>;\n\nexport function useUpdatableTree(\n initialTree: TreeData[],\n entityTypes: Map<number, EntityType>,\n): [TreeState, TreeDispatch] {\n // Get the first entity type\n // issue: grabs second entity instead of selected one\n const type = entityTypes.values().next().value;\n\n return useReducer(treeReducer, {\n initialTree,\n tree: initialTree,\n selectedNodes: [],\n entityTypesMap: entityTypes,\n selectedEntityType: type,\n lastInternalId: 0,\n isSelectingEntityType: false,\n viewMode: ViewMode.Tree,\n });\n}\n\nexport const TreeDispatchContext = createContext<TreeDispatch | null>(null);\n\nexport function useTreeDispatch() {\n const dispatch = useContext(TreeDispatchContext);\n if (dispatch == null) {\n throw new Error(\"No dispatch context available\");\n }\n return dispatch;\n}\n\nfunction treeReducer(state: TreeState, action: TreeAction) {\n switch (action.type) {\n case \"add-entity-type\": {\n // Add a new entity type to the map\n const { name, description, color } = action.payload;\n const newId = state.lastInternalId - 1;\n const newType: EntityType = {\n id: newId,\n name,\n description: description === \"\" ? null : description,\n color,\n };\n\n const newEntityTypesMap = new Map(state.entityTypesMap);\n newEntityTypesMap.set(newId, newType);\n\n return {\n ...state,\n entityTypesMap: newEntityTypesMap,\n selectedEntityType: newType,\n lastInternalId: newId,\n };\n }\n case \"update-entity-type\": {\n // Update an existing entity type in the map\n const { id, name, description, color } = action.payload;\n const newEntityTypesMap = new Map(state.entityTypesMap);\n const oldType = newEntityTypesMap.get(id);\n\n if (!oldType) {\n console.warn(`Entity type with id ${id} not found`);\n return state;\n }\n\n const updatedType: EntityType = {\n ...oldType,\n name,\n description: description === \"\" ? null : description,\n color,\n };\n\n newEntityTypesMap.set(id, updatedType);\n\n // Update the tree to reflect the new type\n const newTree = updateTreeTypes(state.tree, oldType, updatedType);\n\n return {\n ...state,\n tree: newTree,\n entityTypesMap: newEntityTypesMap,\n selectedEntityType: updatedType,\n };\n }\n case \"move-node\":\n // For each node in the tree, if the node is in the dragIds, remove it from the tree and collect it\n const [newTree, removedNodes] = removeNodes(\n state.tree,\n action.payload.dragIds,\n );\n\n let keyPath: (number | \"children\")[] = [];\n if (action.payload.parentId) {\n keyPath = findNode(newTree, action.payload.parentId);\n keyPath.push(\"children\");\n }\n\n // Add removed nodes to the new tree at the correct location\n let updateSpec = buildNestedSpec(keyPath, {\n $splice: [[action.payload.index, 0, ...removedNodes]],\n });\n\n return { ...state, tree: update(newTree, updateSpec) };\n case \"delete-node\":\n // For each node in the tree, if the node is in the ids, remove it from the tree\n const [newTree2, _removedNodes] = removeNodes(\n state.tree,\n action.payload.ids,\n );\n // Get children of the removed nodes\n // If children are not present elsewhere in the tree, insert them\n\n const children = _removedNodes\n .flatMap((node) => node.children ?? [])\n .filter((child) => !nodeIsInTree(newTree2, child.id));\n\n // Reset the selection\n\n return {\n ...state,\n tree: [...newTree2, ...children],\n selectedNodes: state.selectedNodes.filter(\n (id) => !action.payload.ids.includes(id),\n ),\n };\n case \"select-node\":\n const { ids } = action.payload;\n\n const type =\n action.payload.ids.length > 0\n ? findNodeById(state.tree, ids[0])?.type\n : null;\n\n console.log(\"Selecting nodes:\", ids, \"Type:\", type);\n\n return { ...state, selectedNodes: ids, selectedEntityType: type };\n // otherwise fall through to toggle-node-selected for a single ID\n case \"toggle-node-selected\":\n const nodesToAdd = action.payload.ids.filter(\n (id) => !state.selectedNodes.includes(id),\n );\n const nodesToKeep = state.selectedNodes.filter(\n (id) => !action.payload.ids.includes(id),\n );\n\n const newType =\n action.payload.ids.length > 0\n ? findNodeById(state.tree, action.payload.ids[0])?.type\n : null;\n\n return {\n ...state,\n selectedNodes: [...nodesToKeep, ...nodesToAdd],\n selectedEntityType: newType,\n };\n\n case \"create-node\":\n const newId = state.lastInternalId - 1;\n const { text, start, end } = action.payload;\n const node: TreeData = {\n id: newId,\n name: text,\n children: [],\n indices: [start, end],\n type: state.selectedEntityType,\n };\n\n return {\n ...state,\n tree: [...state.tree, node],\n selectedNodes: [newId],\n lastInternalId: newId,\n };\n\n case \"delete-entity-type\": {\n // Remove the entity type from the map\n console.log(\"Deleting entity type:\", action.payload.id);\n const { id } = action.payload;\n const newEntityTypesMap = new Map(state.entityTypesMap);\n const oldType = newEntityTypesMap.get(id);\n newEntityTypesMap.delete(id);\n\n const defaultType = newEntityTypesMap.values().next().value;\n const newTree = updateTreeTypes(state.tree, oldType, defaultType);\n\n return {\n ...state,\n tree: newTree,\n entityTypesMap: newEntityTypesMap,\n selectedNodes: [],\n };\n }\n\n /** Entity type selection */\n case \"toggle-entity-type-selector\":\n return {\n ...state,\n isSelectingEntityType: action.payload ?? !state.isSelectingEntityType,\n };\n case \"select-entity-type\": {\n // For each selected node, update the type\n let newTree2 = state.tree;\n for (let id of state.selectedNodes) {\n const keyPath = findNode(state.tree, id);\n const nestedSpec = buildNestedSpec(keyPath, {\n type: { $set: action.payload },\n });\n newTree2 = update(newTree2, nestedSpec);\n }\n\n return {\n ...state,\n tree: newTree2,\n selectedEntityType: action.payload,\n };\n }\n case \"deselect\":\n return { ...state, selectedNodes: [] };\n case \"reset\":\n return {\n ...state,\n tree: state.initialTree,\n selectedNodes: [],\n };\n case \"set-view-mode\":\n return { ...state, viewMode: action.payload };\n }\n}\n\nfunction nodeIsInTree(tree: TreeData[], id: number): boolean {\n for (let node of tree) {\n if (node.id == id) {\n return true;\n } else if (node.children) {\n if (nodeIsInTree(node.children, id)) {\n return true;\n }\n }\n }\n return false;\n}\n\nfunction buildNestedSpec(\n keyPath: (number | \"children\")[],\n innerSpec: Spec<any>,\n): Spec<TreeData[]> {\n // Build a nested object from a key path\n\n let spec = innerSpec;\n for (let i = keyPath.length - 1; i >= 0; i--) {\n spec = { [keyPath[i]]: spec };\n }\n return spec as any;\n // Since we don't have a \"children\" key at the root, we make the top-level spec an array\n}\n\nfunction findNode(\n tree: TreeData[],\n id: number,\n): (number | \"children\")[] | null {\n // Find the index of the node with the given id in the tree, returning the key path\n for (let i = 0; i < tree.length; i++) {\n if (tree[i].id == id) {\n return [i];\n } else if (tree[i].children) {\n let path = findNode(tree[i].children, id);\n if (path != null) {\n return [i, \"children\", ...path];\n }\n }\n }\n return null;\n}\n\nfunction removeNodes(\n tree: TreeData[],\n ids: number[],\n): [TreeData[], TreeData[]] {\n /** Remove nodes with the given ids from the tree and return the new tree and the removed nodes */\n let newTree: TreeData[] = [];\n let removedNodes: TreeData[] = [];\n\n for (let node of tree) {\n if (ids.includes(node.id)) {\n removedNodes.push(node);\n } else {\n // Recurse into children\n if (node.children) {\n let [newChildren, removedChildren] = removeNodes(node.children, ids);\n node = { ...node, children: newChildren };\n removedNodes.push(...removedChildren);\n }\n newTree.push(node);\n }\n }\n\n return [newTree, removedNodes];\n}\n\nexport interface EntityOutput {\n id: number;\n type: number | null;\n txt_range: number[][];\n name: string;\n match: any | null;\n reasoning: string | null;\n color: string | null;\n children: any[] | null;\n}\n\nexport interface GraphData {\n nodes: EntityOutput[];\n edges: { source: number; dest: number }[];\n}\n\nexport function treeToGraph(tree: TreeData[]): GraphData {\n // Convert the tree to a graph\n let nodes: EntityOutput[] = [];\n let edges: { source: number; dest: number }[] = [];\n const nodeMap = new Map<number, TreeData>();\n\n for (let node of tree) {\n // If we've already found an instance of this node, we don't need to record\n // it again\n if (nodeMap.has(node.id)) {\n continue;\n }\n\n const { indices, id, name, type, children } = node;\n\n const nodeData: EntityOutput = {\n id,\n type: type.id,\n color: type.color,\n name,\n txt_range: [indices],\n reasoning: null,\n match: node.match,\n children,\n };\n\n nodeMap.set(node.id, node);\n nodes.push(nodeData);\n\n if (node.children) {\n for (let child of node.children) {\n edges.push({ source: node.id, dest: child.id });\n }\n\n // Now process the children\n const { nodes: childNodes, edges: childEdges } = treeToGraph(\n node.children,\n );\n nodes.push(...childNodes);\n edges.push(...childEdges);\n }\n }\n\n return { nodes, edges };\n}\n\nfunction findNodeById(tree, id) {\n for (const node of tree) {\n if (node.id === id) {\n return node;\n }\n if (node.children) {\n const found = findNodeById(node.children, id);\n if (found) return found;\n }\n }\n return null;\n}\n\nfunction updateTreeTypes(tree, oldType, defaultType) {\n return tree.map((node) => updateNodeType(node, oldType, defaultType));\n}\n\nfunction updateNodeType(node, oldType, defaultType) {\n const type = node.type.id === oldType.id ? defaultType : node.type;\n\n return {\n ...node,\n type,\n children: node.children\n ? updateTreeTypes(node.children, oldType, defaultType)\n : [],\n };\n}\n"],"names":["useReducer","$eGztG$useReducer","createContext","$eGztG$createContext","useContext","$eGztG$useContext","$eGztG$immutabilityhelper","ViewMode","$330ae695507d96f5$export$53ec42062883b2d4","$330ae695507d96f5$export$911bb4b9c8065d3d","initialTree","entityTypes","type","values","next","value","$330ae695507d96f5$var$treeReducer","tree","selectedNodes","entityTypesMap","selectedEntityType","lastInternalId","isSelectingEntityType","viewMode","$330ae695507d96f5$export$e5ce04c5b3f58533","$330ae695507d96f5$export$e1068f2d1c68f87e","dispatch","Error","state","action","name","description","color","payload","newId","newType","id","newEntityTypesMap","Map","set","oldType","get","console","warn","updatedType","newTree","$330ae695507d96f5$var$updateTreeTypes","removedNodes","$330ae695507d96f5$var$removeNodes","dragIds","keyPath","parentId","$330ae695507d96f5$var$findNode","push","updateSpec","$330ae695507d96f5$var$buildNestedSpec","$splice","index","newTree2","_removedNodes","ids","children","flatMap","node","filter","child","$330ae695507d96f5$var$nodeIsInTree","includes","length","$330ae695507d96f5$var$findNodeById","log","nodesToAdd","nodesToKeep","text","start","end","indices","delete","defaultType","$set","innerSpec","spec","i","path","newChildren","removedChildren","$330ae695507d96f5$export$8d9dbb7a64bf2a5e","nodes","edges","nodeMap","has","nodeData","txt_range","reasoning","match","source","dest","childNodes","childEdges","found","map","$330ae695507d96f5$var$updateNodeType","useUpdatableTree","TreeDispatchContext","useTreeDispatch","treeToGraph"],"version":3,"file":"feedback-components.e2f3c4b7.js.map","sourceRoot":"../../../../"}