utils.go 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496
  1. package main
  2. import (
  3. "fmt"
  4. "github.com/xuri/excelize/v2"
  5. "math/big"
  6. "reflect"
  7. "sort"
  8. "strconv"
  9. "strings"
  10. )
  11. //isGreaterThanHalf 是否大于一半
  12. func isGreaterThanHalf(x interface{}) bool {
  13. switch v := x.(type) {
  14. case string:
  15. f, err := strconv.ParseFloat(v, 64)
  16. if err != nil {
  17. return false
  18. }
  19. return f > 0.5
  20. case float64:
  21. return v > 0.5
  22. case int:
  23. return float64(v) > 0.5
  24. case int64:
  25. return float64(v) > 0.5
  26. default:
  27. return false
  28. }
  29. }
  30. func IntAll(num interface{}) int {
  31. return IntAllDef(num, 0)
  32. }
  33. func IntAllDef(num interface{}, defaultNum int) int {
  34. if i, ok := num.(int); ok {
  35. return int(i)
  36. } else if i0, ok0 := num.(int32); ok0 {
  37. return int(i0)
  38. } else if i1, ok1 := num.(float64); ok1 {
  39. return int(i1)
  40. } else if i2, ok2 := num.(int64); ok2 {
  41. return int(i2)
  42. } else if i3, ok3 := num.(float32); ok3 {
  43. return int(i3)
  44. } else if i4, ok4 := num.(string); ok4 {
  45. in, _ := strconv.Atoi(i4)
  46. return int(in)
  47. } else if i5, ok5 := num.(int16); ok5 {
  48. return int(i5)
  49. } else if i6, ok6 := num.(int8); ok6 {
  50. return int(i6)
  51. } else if i7, ok7 := num.(*big.Int); ok7 {
  52. in, _ := strconv.Atoi(fmt.Sprint(i7))
  53. return int(in)
  54. } else if i8, ok8 := num.(*big.Float); ok8 {
  55. in, _ := strconv.Atoi(fmt.Sprint(i8))
  56. return int(in)
  57. } else {
  58. return defaultNum
  59. }
  60. }
  61. func Int64All(num interface{}) int64 {
  62. if i, ok := num.(int64); ok {
  63. return int64(i)
  64. } else if i0, ok0 := num.(int32); ok0 {
  65. return int64(i0)
  66. } else if i1, ok1 := num.(float64); ok1 {
  67. return int64(i1)
  68. } else if i2, ok2 := num.(int); ok2 {
  69. return int64(i2)
  70. } else if i3, ok3 := num.(float32); ok3 {
  71. return int64(i3)
  72. } else if i4, ok4 := num.(string); ok4 {
  73. i64, _ := strconv.ParseInt(i4, 10, 64)
  74. //in, _ := strconv.Atoi(i4)
  75. return i64
  76. } else if i5, ok5 := num.(int16); ok5 {
  77. return int64(i5)
  78. } else if i6, ok6 := num.(int8); ok6 {
  79. return int64(i6)
  80. } else if i7, ok7 := num.(*big.Int); ok7 {
  81. in, _ := strconv.ParseInt(fmt.Sprint(i7), 10, 64)
  82. return int64(in)
  83. } else if i8, ok8 := num.(*big.Float); ok8 {
  84. in, _ := strconv.ParseInt(fmt.Sprint(i8), 10, 64)
  85. return int64(in)
  86. } else {
  87. return 0
  88. }
  89. }
  90. func Float64All(num interface{}) float64 {
  91. if i, ok := num.(float64); ok {
  92. return float64(i)
  93. } else if i0, ok0 := num.(int32); ok0 {
  94. return float64(i0)
  95. } else if i1, ok1 := num.(int64); ok1 {
  96. return float64(i1)
  97. } else if i2, ok2 := num.(int); ok2 {
  98. return float64(i2)
  99. } else if i3, ok3 := num.(float32); ok3 {
  100. return float64(i3)
  101. } else if i4, ok4 := num.(string); ok4 {
  102. in, _ := strconv.ParseFloat(i4, 64)
  103. return in
  104. } else if i5, ok5 := num.(int16); ok5 {
  105. return float64(i5)
  106. } else if i6, ok6 := num.(int8); ok6 {
  107. return float64(i6)
  108. } else if i6, ok6 := num.(uint); ok6 {
  109. return float64(i6)
  110. } else if i6, ok6 := num.(uint8); ok6 {
  111. return float64(i6)
  112. } else if i6, ok6 := num.(uint16); ok6 {
  113. return float64(i6)
  114. } else if i6, ok6 := num.(uint32); ok6 {
  115. return float64(i6)
  116. } else if i6, ok6 := num.(uint64); ok6 {
  117. return float64(i6)
  118. } else if i7, ok7 := num.(*big.Float); ok7 {
  119. in, _ := strconv.ParseFloat(fmt.Sprint(i7), 64)
  120. return float64(in)
  121. } else if i8, ok8 := num.(*big.Int); ok8 {
  122. in, _ := strconv.ParseFloat(fmt.Sprint(i8), 64)
  123. return float64(in)
  124. } else {
  125. return 0
  126. }
  127. }
  128. func ObjToString(old interface{}) string {
  129. if nil == old {
  130. return ""
  131. } else {
  132. r, _ := old.(string)
  133. return r
  134. }
  135. }
  136. //DeduplicateByField 去重 []map 中,field 相同的数据
  137. func DeduplicateByField(maps []map[string]interface{}, field string) []map[string]interface{} {
  138. result := []map[string]interface{}{}
  139. cache := make(map[string]bool)
  140. for _, m := range maps {
  141. if name, ok := m[field].(string); ok {
  142. if !cache[name] {
  143. result = append(result, m)
  144. cache[name] = true
  145. }
  146. }
  147. }
  148. return result
  149. }
  150. //IsInStringArray 判断数组中是否存在字符串
  151. func IsInStringArray(str string, arr []string) bool {
  152. // 先对字符串数组进行排序
  153. sort.Strings(arr)
  154. // 使用二分查找算法查找字符串
  155. pos := sort.SearchStrings(arr, str)
  156. // 如果找到了则返回 true,否则返回 false
  157. return pos < len(arr) && arr[pos] == str
  158. }
  159. func isInMapArray(data map[string]interface{}, arr []map[string]interface{}) bool {
  160. for _, item := range arr {
  161. if reflect.DeepEqual(item, data) {
  162. return true
  163. }
  164. }
  165. return false
  166. }
  167. //traverseDataInvest 处理投资下级数据
  168. func traverseDataInvest(xlsx *excelize.File, data []map[string]interface{}, level int) {
  169. if len(data) <= 0 {
  170. return
  171. }
  172. if level > GF.Env.Invesl {
  173. return
  174. }
  175. //var currentLine int
  176. Sheet := fmt.Sprintf("投资下级%v", level)
  177. preSheet := fmt.Sprintf("投资下级%v", level-1)
  178. currentLine := lineMap[Sheet]
  179. preLine := lineMap[preSheet]
  180. for k, v := range data {
  181. inves := getInvests(v["company_id"].(string))
  182. invest := dealInves(inves)
  183. if len(invest) <= 0 {
  184. return
  185. }
  186. if len(invest) > 0 {
  187. fmt.Println("开始投资公司下级", level, v["company_name"])
  188. _, currentLine = setInvest(xlsx, invest, ObjToString(v["company_name"]), Sheet, currentLine)
  189. lineMap[Sheet] = currentLine
  190. linkCell := fmt.Sprintf("B%d", preLine-len(data)+1+k)
  191. linkAddr := fmt.Sprintf("%s!C%d", Sheet, currentLine-len(invest)+1)
  192. link := map[string]string{
  193. "sheet": preSheet,
  194. "cell": linkCell,
  195. "addr": linkAddr,
  196. "value": "下级",
  197. }
  198. links = append(links, link)
  199. //
  200. AlinkAddr := fmt.Sprintf("%s!C%d", preSheet, preLine-len(data)+1+k)
  201. for t := currentLine - len(invest) + 1; t <= currentLine; t++ {
  202. AlinkCell := fmt.Sprintf("A%d", t)
  203. Alink := map[string]string{
  204. "sheet": Sheet,
  205. "cell": AlinkCell,
  206. "addr": AlinkAddr,
  207. "value": "上级",
  208. }
  209. links = append(links, Alink)
  210. }
  211. traverseDataInvest(xlsx, invest, level+1)
  212. }
  213. }
  214. }
  215. //traverseDataSub 处理分支机构下级数据
  216. func traverseDataSub(xlsx *excelize.File, data []map[string]interface{}, level int) {
  217. if len(data) <= 0 {
  218. return
  219. }
  220. if level > GF.Env.Subl {
  221. return
  222. }
  223. Sheet := fmt.Sprintf("分支下级%v", level)
  224. preSheet := fmt.Sprintf("分支下级%v", level-1)
  225. currentLine := lineMap[Sheet]
  226. preline := lineMap[preSheet]
  227. for k, v := range data {
  228. if v["branch_company_id"] == nil {
  229. continue
  230. }
  231. fmt.Println("开始 分支机构 下级 ", level, v["branch_name"])
  232. subs := getSubCompany(v["branch_company_id"].(string))
  233. subData := dealSubs(subs)
  234. if len(subData) <= 0 {
  235. return
  236. }
  237. if len(subData) > 0 {
  238. fmt.Println("开始分支下级", level, v["company_name"])
  239. _, currentLine = setSubCompany(xlsx, data, v["branch_name"].(string), Sheet, currentLine)
  240. linkCell := fmt.Sprintf("B%d", preline-len(data)+1+k)
  241. linkAddr := fmt.Sprintf("%s!C%d", Sheet, currentLine-len(subData)+1)
  242. link := map[string]string{
  243. "sheet": preSheet,
  244. "cell": linkCell,
  245. "addr": linkAddr,
  246. "value": "下级",
  247. }
  248. links = append(links, link)
  249. AlinkAddr := fmt.Sprintf("%s!C%d", preSheet, preline-len(data)+1+k)
  250. for t := currentLine - len(subData) + 1; t <= currentLine; t++ {
  251. AlinkCell := fmt.Sprintf("A%d", t)
  252. Alink := map[string]string{
  253. "sheet": Sheet,
  254. "cell": AlinkCell,
  255. "addr": AlinkAddr,
  256. "value": "上级",
  257. }
  258. links = append(links, Alink)
  259. }
  260. traverseDataSub(xlsx, subData, level+1)
  261. }
  262. }
  263. }
  264. func dealLast(xlsx *excelize.File) {
  265. fmt.Println("22222222222222222222222222")
  266. xlsx.NewSheet("最后数据")
  267. var line int
  268. line++
  269. xlsx.SetSheetRow("最后数据", fmt.Sprintf("A%v", line), &[]interface{}{"L0", "name", "L2", "控股比例", "登记状态", "统一信用代码", "省", "市", "区"})
  270. for _, v := range L0names {
  271. oldData := LastData[v]
  272. newData := lastRes[v]
  273. if len(newData) >= len(oldData) {
  274. for k, data := range newData {
  275. newda, _ := data.([]interface{})
  276. if k+1 <= len(oldData) {
  277. oldda, _ := oldData[k].([]interface{})
  278. line++
  279. xlsx.SetSheetRow("最后数据", fmt.Sprintf("A%v", line), &[]interface{}{newda[0], newda[1], oldda[1], newda[2], newda[3], newda[4], newda[5], newda[6], newda[7]})
  280. } else {
  281. line++
  282. xlsx.SetSheetRow("最后数据", fmt.Sprintf("A%v", line), &[]interface{}{newda[0], newda[1], "", newda[2], newda[3], newda[4], newda[5], newda[6], newda[7]})
  283. }
  284. }
  285. } else {
  286. for k, data := range oldData {
  287. oldda, _ := data.([]interface{})
  288. if k+1 <= len(newData) {
  289. newda, _ := newData[k].([]interface{})
  290. line++
  291. xlsx.SetSheetRow("最后数据", fmt.Sprintf("A%v", line), &[]interface{}{oldda[0], newda[1], oldda[1], newda[2], newda[3], newda[4], newda[5], newda[6], newda[7]})
  292. } else {
  293. line++
  294. xlsx.SetSheetRow("最后数据", fmt.Sprintf("A%v", line), &[]interface{}{oldda[0], "", oldda[1]})
  295. }
  296. }
  297. }
  298. }
  299. //for k, v := range final {
  300. // err := xlsx.SetSheetRow("最后数据", fmt.Sprintf("A%v", k+1), &v)
  301. // if err != nil {
  302. // fmt.Println(err)
  303. // }
  304. //}
  305. fmt.Println("最后数据 sheet 结束")
  306. }
  307. //traverInvestP 投资上级
  308. func traverInvestP(xlsx *excelize.File, data []map[string]interface{}, level int) {
  309. if len(data) <= 0 {
  310. return
  311. }
  312. if level == GF.Env.Pinvesl {
  313. for _, v := range data {
  314. if v["stock_type"] == "自然人股东" || v["stock_type"] == "外国(地区)企业" && (v["company_area"] == "" || v["company_area"] == nil) || strings.HasSuffix(v["stock_name"].(string), "国务院") || strings.HasSuffix(v["stock_name"].(string), "国资委") || strings.HasSuffix(v["stock_name"].(string), "国有资产监督管理委员会") || strings.Contains(v["stock_name"].(string), "财政厅") || v["is_break"] == true {
  315. continue
  316. }
  317. tmp := []interface{}{L0, v["stock_name"]}
  318. if !IsContained(tmp, lastRes[L0]) {
  319. lastRes[L0] = append(lastRes[L0], tmp)
  320. }
  321. }
  322. return
  323. }
  324. Sheet := fmt.Sprintf("投资上级%v", level) //投资上级2
  325. preSheet := fmt.Sprintf("投资上级%v", level-1) //投资上级1
  326. currentLine := lineMap[Sheet]
  327. preLine := lineMap[preSheet]
  328. for k, v := range data {
  329. fmt.Println("开始投资公司上级 ---------------", level, v["company_name"].(string))
  330. pinves := getParentsByPartner(v["stock_name_id"].(string))
  331. datas, isbreak := dealPinves(pinves, level)
  332. if len(datas) == 0 {
  333. return
  334. }
  335. _, currentLine = setInvestP(xlsx, datas, v["company_name"].(string), Sheet, currentLine)
  336. lineMap[Sheet] = currentLine
  337. linkCell := fmt.Sprintf("B%d", preLine-len(data)+k+1)
  338. linkAddr := fmt.Sprintf("%s!C%d", Sheet, currentLine-len(datas)+1)
  339. link := map[string]string{
  340. "sheet": preSheet,
  341. "cell": linkCell,
  342. "addr": linkAddr,
  343. "value": "上级",
  344. }
  345. links = append(links, link)
  346. AlinkAddr2 := fmt.Sprintf("%s!A%d", preSheet, preLine-len(data)+k+1)
  347. for t := currentLine - len(datas) + 1; t <= currentLine; t++ {
  348. AlinkCell2 := fmt.Sprintf("A%d", t)
  349. Alink2 := map[string]string{
  350. "sheet": Sheet,
  351. "cell": AlinkCell2,
  352. "addr": AlinkAddr2,
  353. "value": "下级",
  354. }
  355. links = append(links, Alink2)
  356. }
  357. if v["stock_name"] == nil {
  358. continue
  359. }
  360. if v["stock_type"] == "自然人股东" {
  361. continue
  362. }
  363. if v["stock_type"] == "自然人股东" || v["stock_type"] == "外国(地区)企业" && (v["company_area"] == "" || v["company_area"] == nil) || strings.HasSuffix(v["stock_name"].(string), "国务院") || strings.HasSuffix(v["stock_name"].(string), "国资委") || strings.HasSuffix(v["stock_name"].(string), "国有资产监督管理委员会") || strings.Contains(v["stock_name"].(string), "财政厅") || v["is_break"] == true {
  364. continue
  365. }
  366. if level+1 <= GF.Env.Pinvesl {
  367. if isbreak {
  368. continue
  369. } else {
  370. traverInvestP(xlsx, datas, level+1)
  371. }
  372. }
  373. }
  374. }
  375. //traverSubP 分支上级
  376. func traverSubP(xlsx *excelize.File, data []map[string]interface{}, level int) {
  377. if len(data) <= 0 {
  378. return
  379. }
  380. if level > GF.Env.Psubl {
  381. return
  382. }
  383. Sheet := fmt.Sprintf("分支上级%v", level) //投资上级2
  384. preSheet := fmt.Sprintf("分支上级%v", level-1) //投资上级1
  385. currentLine := lineMap[Sheet]
  386. preLine := lineMap[preSheet]
  387. for k, v := range data {
  388. if v["company_id"] == nil {
  389. continue
  390. }
  391. if v["company_name"] == nil {
  392. fmt.Println("2222333333")
  393. }
  394. fmt.Println("开始分支上级 ---------------", level, v["branch_name"].(string))
  395. datas := getParentsByBranch(v["company_id"].(string))
  396. res := dealPsubs(datas)
  397. if len(res) == 0 {
  398. continue
  399. }
  400. _, currentLine = setSubP(xlsx, res, v["company_name"].(string), Sheet, currentLine)
  401. lineMap[Sheet] = currentLine
  402. linkCell := fmt.Sprintf("B%d", preLine-len(data)+k+1)
  403. linkAddr := fmt.Sprintf("%s!C%d", Sheet, currentLine-len(res)+1)
  404. link := map[string]string{
  405. "sheet": preSheet,
  406. "cell": linkCell,
  407. "addr": linkAddr,
  408. "value": "上级",
  409. }
  410. links = append(links, link)
  411. AlinkAddr2 := fmt.Sprintf("%s!A%d", preSheet, preLine+k+1)
  412. for t := currentLine - len(res) + 1; t < currentLine; t++ {
  413. AlinkCell2 := fmt.Sprintf("A%d", t)
  414. Alink2 := map[string]string{
  415. "sheet": Sheet,
  416. "cell": AlinkCell2,
  417. "addr": AlinkAddr2,
  418. "value": "下级",
  419. }
  420. links = append(links, Alink2)
  421. }
  422. //
  423. if v["company_id"] == nil || v["company_name"] == nil {
  424. continue
  425. }
  426. if strings.HasSuffix(v["company_name"].(string), "国务院") || strings.HasSuffix(v["company_name"].(string), "国资委") || strings.HasSuffix(v["company_name"].(string), "国有资产监督管理委员会") {
  427. continue
  428. }
  429. if level+1 < GF.Env.Psubl {
  430. traverSubP(xlsx, res, level+1)
  431. }
  432. }
  433. }
  434. //IsContained 判断一个切片是否存在 另外一个切片数组中
  435. func IsContained(target []interface{}, container []interface{}) bool {
  436. for _, v := range container {
  437. if reflect.DeepEqual(v, target) {
  438. return true
  439. }
  440. }
  441. return false
  442. }