bfg-common 1.0.15 → 1.0.17

package/plugins/recursion.ts

@@ -1,230 +1,230 @@
-export default defineNuxtPlugin(() => {
-  const recursion = function () {
-    const self: any = {}
-
-    self.find = function (
-      arr: any[],
-      value: any,
-      valueProp: string,
-      itemsProp: string
-    ) {
-      let result = null
-      if (!arr) {
-        return result
-      }
-
-      for (let i = 0; i < arr.length; i++) {
-        const item = arr[i]
-        if (item[valueProp] === value) {
-          result = item
-          break
-        }
-        if (item[itemsProp].length) {
-          result = self.find(item.nodes, value, valueProp, itemsProp)
-          if (result) {
-            break
-          }
-        }
-      }
-      return result
-    }
-
-    self.findAndShow = function (
-      arr: any[],
-      values: any[],
-      valueProps: string[],
-      itemsProp: string
-    ): boolean {
-      if (!arr) return false
-      let res = false
-
-      for (let i = 0; i < arr.length; i++) {
-        const item: any = arr[i]
-
-        const isFind = values.every(
-          (value, index) => value === item[valueProps[index]]
-        )
-        if (isFind) {
-          item.nodesShow = !item.nodesShow
-          res = true
-          break
-        }
-
-        if (item[itemsProp]?.length) {
-          self.findAndShow(item.nodes, values, valueProps, itemsProp)
-        }
-      }
-      return res
-    }
-
-    self.findAndRemove = function (
-      arr: any[],
-      values: any[],
-      valueProps: string[],
-      itemsProp: string
-    ): boolean {
-      if (!arr) return false
-      let res = false
-
-      for (let i = 0; i < arr.length; i++) {
-        const item: any = arr[i]
-
-        const isFind = values.every(
-          (value, index) => value === item[valueProps[index]]
-        )
-        if (isFind) {
-          arr.splice(i, 1)
-          res = true
-          break
-        }
-
-        if (item[itemsProp]?.length) {
-          self.findAndRemove(item[itemsProp], values, valueProps, itemsProp)
-        }
-      }
-      return res
-    }
-    self.findAndMove = function (
-      arr: any[],
-      values: any[],
-      valueProps: string[],
-      itemsProp: string,
-      moveArr: any,
-      findIndex: string
-    ) {
-      let result = null
-      if (!arr) return result
-
-      for (let i = 0; i < arr.length; i++) {
-        const item: any = arr[i]
-
-        const isFind = values.every(
-          (value, index) => value === item[valueProps[index]]
-        )
-
-        if (isFind) {
-          // Remove from the original position
-          const moveItem = arr.splice(i, 1)[0]
-          const index = moveArr[itemsProp].findLastIndex(
-            (x) => x.type === findIndex
-          )
-          moveArr[itemsProp].splice(index + 1, 0, moveItem)
-
-          result = moveItem
-          break
-        }
-
-        if (item[itemsProp]?.length) {
-          result = self.findAndMove(
-            item[itemsProp],
-            values,
-            valueProps,
-            itemsProp,
-            moveArr,
-            findIndex
-          )
-          if (result) break
-        }
-      }
-      return result
-    }
-
-    self.findAndActivate = function (
-      arr: any[],
-      values: any[],
-      valueProps: string[],
-      itemsProp: string
-    ): boolean {
-      if (!arr) return false
-      let res = false
-
-      for (let i = 0; i < arr.length; i++) {
-        const item = arr[i]
-        const isActive = values.every(
-          (value, index) => value === item[valueProps[index]]
-        )
-        item.isActive = isActive
-        if (isActive) {
-          res = true
-        }
-
-        if (item[itemsProp]?.length) {
-          const isFindInChild = self.findAndActivate(
-            item.nodes,
-            values,
-            valueProps,
-            itemsProp
-          )
-          if (!res) res = isFindInChild
-        }
-      }
-      return res
-    }
-
-    // TODO изменить nodes и сделать динамичной
-    self.filtrationTreeByExpectedTypeRecursion = (
-      node: any,
-      expectedType: string | string[]
-    ): any[] | null | any => {
-      if (!node.nodes.length) return { ...node }
-
-      const result = []
-
-      for (let i = 0; i < node.nodes.length; i++) {
-        const item = { ...node.nodes[i] }
-
-        // Проверка, является ли тип ожидаемым типом или массивом ожидаемых типов
-        if (
-          (typeof expectedType === 'string' && item.type === expectedType) ||
-          (Array.isArray(expectedType) && expectedType.includes(item.type))
-        ) {
-          result.push(
-            self.filtrationTreeByExpectedTypeRecursion(item, expectedType)
-          )
-        } else {
-          item.nodes = []
-        }
-      }
-      node.nodes = result
-      return { ...node }
-    }
-
-    self.createAbsolutePathRecursion = (
-      node: any,
-      valueProp: string,
-      parentProp: string
-    ): string => {
-      if (!node) return ''
-
-      const parentPath = self.createAbsolutePathRecursion(
-        node[parentProp],
-        valueProp,
-        parentProp
-      )
-      return (parentPath ? `${parentPath}/` : '') + node[valueProp]
-    }
-
-    self.findParentByValue = (
-      node: any,
-      value: any,
-      valueProp: string,
-      parentProp: string
-    ): any | null => {
-      if (!node) return null
-
-      if (node[valueProp] === value) return node
-      const parent = node[parentProp]
-      if (parent) return self.findParentByValue(parent, value, valueProp, parentProp)
-
-      return null
-    }
-
-    return self
-  }.call({})
-
-  return {
-    provide: {
-      recursion,
-    },
-  }
-})
+export default defineNuxtPlugin(() => {
+  const recursion = function () {
+    const self: any = {}
+
+    self.find = function (
+      arr: any[],
+      value: any,
+      valueProp: string,
+      itemsProp: string
+    ) {
+      let result = null
+      if (!arr) {
+        return result
+      }
+
+      for (let i = 0; i < arr.length; i++) {
+        const item = arr[i]
+        if (item[valueProp] === value) {
+          result = item
+          break
+        }
+        if (item[itemsProp].length) {
+          result = self.find(item.nodes, value, valueProp, itemsProp)
+          if (result) {
+            break
+          }
+        }
+      }
+      return result
+    }
+
+    self.findAndShow = function (
+      arr: any[],
+      values: any[],
+      valueProps: string[],
+      itemsProp: string
+    ): boolean {
+      if (!arr) return false
+      let res = false
+
+      for (let i = 0; i < arr.length; i++) {
+        const item: any = arr[i]
+
+        const isFind = values.every(
+          (value, index) => value === item[valueProps[index]]
+        )
+        if (isFind) {
+          item.nodesShow = !item.nodesShow
+          res = true
+          break
+        }
+
+        if (item[itemsProp]?.length) {
+          self.findAndShow(item.nodes, values, valueProps, itemsProp)
+        }
+      }
+      return res
+    }
+
+    self.findAndRemove = function (
+      arr: any[],
+      values: any[],
+      valueProps: string[],
+      itemsProp: string
+    ): boolean {
+      if (!arr) return false
+      let res = false
+
+      for (let i = 0; i < arr.length; i++) {
+        const item: any = arr[i]
+
+        const isFind = values.every(
+          (value, index) => value === item[valueProps[index]]
+        )
+        if (isFind) {
+          arr.splice(i, 1)
+          res = true
+          break
+        }
+
+        if (item[itemsProp]?.length) {
+          self.findAndRemove(item[itemsProp], values, valueProps, itemsProp)
+        }
+      }
+      return res
+    }
+    self.findAndMove = function (
+      arr: any[],
+      values: any[],
+      valueProps: string[],
+      itemsProp: string,
+      moveArr: any,
+      findIndex: string
+    ) {
+      let result = null
+      if (!arr) return result
+
+      for (let i = 0; i < arr.length; i++) {
+        const item: any = arr[i]
+
+        const isFind = values.every(
+          (value, index) => value === item[valueProps[index]]
+        )
+
+        if (isFind) {
+          // Remove from the original position
+          const moveItem = arr.splice(i, 1)[0]
+          const index = moveArr[itemsProp].findLastIndex(
+            (x) => x.type === findIndex
+          )
+          moveArr[itemsProp].splice(index + 1, 0, moveItem)
+
+          result = moveItem
+          break
+        }
+
+        if (item[itemsProp]?.length) {
+          result = self.findAndMove(
+            item[itemsProp],
+            values,
+            valueProps,
+            itemsProp,
+            moveArr,
+            findIndex
+          )
+          if (result) break
+        }
+      }
+      return result
+    }
+
+    self.findAndActivate = function (
+      arr: any[],
+      values: any[],
+      valueProps: string[],
+      itemsProp: string
+    ): boolean {
+      if (!arr) return false
+      let res = false
+
+      for (let i = 0; i < arr.length; i++) {
+        const item = arr[i]
+        const isActive = values.every(
+          (value, index) => value === item[valueProps[index]]
+        )
+        item.isActive = isActive
+        if (isActive) {
+          res = true
+        }
+
+        if (item[itemsProp]?.length) {
+          const isFindInChild = self.findAndActivate(
+            item.nodes,
+            values,
+            valueProps,
+            itemsProp
+          )
+          if (!res) res = isFindInChild
+        }
+      }
+      return res
+    }
+
+    // TODO изменить nodes и сделать динамичной
+    self.filtrationTreeByExpectedTypeRecursion = (
+      node: any,
+      expectedType: string | string[]
+    ): any[] | null | any => {
+      if (!node.nodes.length) return { ...node }
+
+      const result = []
+
+      for (let i = 0; i < node.nodes.length; i++) {
+        const item = { ...node.nodes[i] }
+
+        // Проверка, является ли тип ожидаемым типом или массивом ожидаемых типов
+        if (
+          (typeof expectedType === 'string' && item.type === expectedType) ||
+          (Array.isArray(expectedType) && expectedType.includes(item.type))
+        ) {
+          result.push(
+            self.filtrationTreeByExpectedTypeRecursion(item, expectedType)
+          )
+        } else {
+          item.nodes = []
+        }
+      }
+      node.nodes = result
+      return { ...node }
+    }
+
+    self.createAbsolutePathRecursion = (
+      node: any,
+      valueProp: string,
+      parentProp: string
+    ): string => {
+      if (!node) return ''
+
+      const parentPath = self.createAbsolutePathRecursion(
+        node[parentProp],
+        valueProp,
+        parentProp
+      )
+      return (parentPath ? `${parentPath}/` : '') + node[valueProp]
+    }
+
+    self.findParentByValue = (
+      node: any,
+      value: any,
+      valueProp: string,
+      parentProp: string
+    ): any | null => {
+      if (!node) return null
+
+      if (node[valueProp] === value) return node
+      const parent = node[parentProp]
+      if (parent) return self.findParentByValue(parent, value, valueProp, parentProp)
+
+      return null
+    }
+
+    return self
+  }.call({})
+
+  return {
+    provide: {
+      recursion,
+    },
+  }
+})