analytable.go 96 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041204220432044204520462047204820492050205120522053205420552056205720582059206020612062206320642065206620672068206920702071207220732074207520762077207820792080208120822083208420852086208720882089209020912092209320942095209620972098209921002101210221032104210521062107210821092110211121122113211421152116211721182119212021212122212321242125212621272128212921302131213221332134213521362137213821392140214121422143214421452146214721482149215021512152215321542155215621572158215921602161216221632164216521662167216821692170217121722173217421752176217721782179218021812182218321842185218621872188218921902191219221932194219521962197219821992200220122022203220422052206220722082209221022112212221322142215221622172218221922202221222222232224222522262227222822292230223122322233223422352236223722382239224022412242224322442245224622472248224922502251225222532254225522562257225822592260226122622263226422652266226722682269227022712272227322742275227622772278227922802281228222832284228522862287228822892290229122922293229422952296229722982299230023012302230323042305230623072308230923102311231223132314231523162317231823192320232123222323232423252326232723282329233023312332233323342335233623372338233923402341234223432344234523462347234823492350235123522353235423552356235723582359236023612362236323642365236623672368236923702371237223732374237523762377237823792380238123822383238423852386238723882389239023912392239323942395239623972398239924002401240224032404240524062407240824092410241124122413241424152416241724182419242024212422242324242425242624272428242924302431243224332434243524362437243824392440244124422443244424452446244724482449245024512452245324542455245624572458245924602461246224632464246524662467246824692470247124722473247424752476247724782479248024812482248324842485248624872488248924902491249224932494249524962497249824992500250125022503250425052506250725082509251025112512251325142515251625172518251925202521252225232524252525262527252825292530253125322533253425352536253725382539254025412542254325442545254625472548254925502551255225532554255525562557255825592560256125622563256425652566256725682569257025712572257325742575257625772578257925802581258225832584258525862587258825892590259125922593259425952596259725982599260026012602260326042605260626072608260926102611261226132614261526162617261826192620262126222623262426252626262726282629263026312632263326342635263626372638263926402641264226432644264526462647264826492650265126522653265426552656265726582659266026612662266326642665266626672668266926702671267226732674267526762677267826792680268126822683268426852686268726882689269026912692269326942695269626972698269927002701270227032704270527062707270827092710271127122713271427152716271727182719272027212722272327242725272627272728272927302731273227332734273527362737273827392740274127422743274427452746274727482749275027512752275327542755275627572758275927602761276227632764276527662767276827692770277127722773277427752776277727782779278027812782278327842785278627872788278927902791279227932794279527962797279827992800280128022803280428052806280728082809281028112812281328142815281628172818281928202821282228232824282528262827282828292830283128322833283428352836283728382839284028412842284328442845284628472848284928502851285228532854285528562857285828592860286128622863286428652866286728682869287028712872287328742875287628772878287928802881288228832884288528862887288828892890289128922893289428952896289728982899290029012902290329042905290629072908290929102911291229132914291529162917291829192920292129222923292429252926292729282929293029312932293329342935293629372938293929402941294229432944294529462947294829492950295129522953295429552956295729582959296029612962296329642965296629672968296929702971297229732974297529762977297829792980298129822983298429852986298729882989299029912992299329942995299629972998299930003001300230033004300530063007300830093010301130123013301430153016301730183019302030213022302330243025302630273028302930303031303230333034303530363037303830393040304130423043304430453046304730483049305030513052305330543055305630573058305930603061306230633064306530663067306830693070307130723073307430753076307730783079308030813082308330843085308630873088308930903091309230933094309530963097309830993100310131023103310431053106310731083109311031113112311331143115311631173118311931203121312231233124312531263127312831293130313131323133313431353136313731383139314031413142314331443145314631473148314931503151315231533154315531563157315831593160316131623163316431653166316731683169317031713172317331743175317631773178317931803181318231833184318531863187318831893190319131923193319431953196319731983199320032013202320332043205320632073208320932103211321232133214321532163217321832193220322132223223322432253226322732283229323032313232323332343235323632373238323932403241324232433244324532463247324832493250325132523253325432553256325732583259326032613262326332643265326632673268326932703271327232733274327532763277327832793280328132823283328432853286328732883289329032913292329332943295329632973298329933003301330233033304330533063307330833093310331133123313331433153316331733183319332033213322332333243325332633273328332933303331333233333334
  1. package pretreated
  2. import (
  3. "fmt"
  4. u "jy/util"
  5. qutil "qfw/util"
  6. "regexp"
  7. "strings"
  8. "github.com/PuerkitoBio/goquery"
  9. )
  10. /**
  11. 全局变量,主要是一堆判断正则
  12. **/
  13. var (
  14. //清理品目中数字
  15. numclear = regexp.MustCompile("^[\\d一二三四五六七八九十.]+")
  16. //清理表格title中的不需要的内容
  17. tabletitleclear = regexp.MustCompile("[\\s\u3000\u2003\u00a0\\n、.,.。、_/((人民币万元件个公斤))]")
  18. //清理表格中是key中包含的空格或数字等
  19. tablekeyclear = regexp.MustCompile("[\\s\u3000\u2003\u00a0\\n、.,.。、_/]+|^[\\d一二三四五六七八九十]+[、.]*|[((【\\[].*?[))】\\]]")
  20. //清理表格td中的符号
  21. tabletdclear = regexp.MustCompile("[\\s\u3000\u2003\u00a0\\n、,。、_??;;~\\-#\\\\()(){}【】\\[\\]<>《》{}〔〕¥$]*")
  22. //判断key是金额,对万元的处理
  23. moneyreg = regexp.MustCompile("(预算|费|价|额|规模|投资)")
  24. //根据表格的内容判断是不是表头,如果含有金额则不是表头
  25. MoneyReg = regexp.MustCompile("^[\\s  ::0-9.万元()()人民币¥$]+$")
  26. //判断分包时
  27. moneyNum = regexp.MustCompile("[元整¥万]")
  28. //对隐藏表格的判断
  29. display = regexp.MustCompile("(?i).*?display\\s?[:]\\s?none.*")
  30. //---------------
  31. //求是分包的概率
  32. //根据表格的标签对分包进行打分
  33. TableMultiPackageReg_4 = regexp.MustCompile("(标段|分包|包段|划分|子包|标包|合同段)")
  34. TableMultiPackageReg_2 = regexp.MustCompile("(概况|范围|情况|内容|详细|结果|信息)")
  35. //在判断分包打分前过虑表格key
  36. FilterKey_2 = regexp.MustCompile("招标|投标|项目")
  37. //根据表格的key进行分包打分
  38. FindKey_2 = regexp.MustCompile("([分子][包标](号)?|标[号项段包](划分)?|包件?[号段名数])")
  39. //对值进行分包判断
  40. FindVal_1 = regexp.MustCompile("[第]?([一二三四五六七八九十0-9A-Za-zⅠⅡⅢⅣⅤⅥⅦⅧⅨⅩⅪⅫ]+)((子|合同|分|施工|监理)?(标段?|包|合同段|标包))|((子|合同|分|施工|监理)?(标|包)(段|号)?)[  \u3000\u2003\u00a0]*([一二三四五六七八九十0-9A-Za-zⅠⅡⅢⅣⅤⅥⅦⅧⅨⅩⅪⅫ]+)")
  41. FindVal2_1 = regexp.MustCompile("([一二三四五六七八九十0-9A-Za-zⅠⅡⅢⅣⅤⅥⅦⅧⅨⅩⅪⅫ\\-]+)|^(设计|施工|监理|验收)[分子]?[标包]?[段号]?$")
  42. //判断分包前排除
  43. excludeKey = regexp.MustCompile("(涉及包号|包件号?|项目标号|规格|型号|招标范围|业绩|废标)|(^编号$)|([^包段标]编号)") //编号|划分
  44. //-------------
  45. cut = u.NewCut()
  46. //清理表格标签正则
  47. ClearTagReg = regexp.MustCompile("<[^>]*?>|[\\s\\n\\r]*$")
  48. //查找表格标签正则
  49. ttagreg = regexp.MustCompile("(?s)([^\\n::。,;\\s\u3000\u2003\u00a0]{2,30})[::]?[^::。;!\\n]{0,35}[\\s\\n]*$")
  50. //判断表格是表头的概率
  51. checkval = float32(0.6)
  52. //tdval_reg = regexp.MustCompile(`([\p{Han}][\p{Han}\s、()\\(\\)]{1,9})[::]([^::\\n。]{5,60})(?:[;;,,.。\\n\\t\\s])?`)
  53. //空格替换
  54. repSpace = regexp.MustCompile("[\\s\u3000\u2003\u00a0::]+|\\\\t+")
  55. //对表格kv的处理
  56. //对不能标准化的key做批识
  57. filter_tag_zb = regexp.MustCompile("(中标|成交|投标)[\\p{Han}]{0,6}(情况|结果|信息|明细)")
  58. //中标金额
  59. //包含以下字眼做标准化处理
  60. filter_zbje_k = regexp.MustCompile("(中标|成交|总|拦标|合同|供[应货]商|报)[\\p{Han}、]{0,6}(价|额|[大小]写|[万亿]?元).{0,4}$")
  61. //简单判断金额
  62. filter_zbje_jd = regexp.MustCompile("^[^售]{0,4}(价|额).{0,4}$")
  63. //且排队以下字眼的key
  64. filter_zbje_kn = regexp.MustCompile("得分|打分|时间|业绩|须知|分$")
  65. //且值包含以下字眼
  66. filter_zbje_v = regexp.MustCompile("[¥$$0-9一二三四五六七八九十,,〇零点..壹贰叁肆伍陆柒捌玖拾百佰千仟万亿億元圆角分整正()::大小写]{2,16}")
  67. //中标单位的处理
  68. //包含以下字眼的Key标准化
  69. filter_zbdw_ky = regexp.MustCompile("(中标|成交|拦标|合同|选中|投标|拟|预|最终)[\\p{Han}、]{0,6}(供[应货]商|企业|单位|人|机构)(名称)?.{0,4}$")
  70. //简单判断
  71. filter_zbdw_jd = regexp.MustCompile("(投标|成交|中标|合同)(供应商|单位|人|名称).{0,4}$")
  72. //且不包含以下字眼
  73. filter_zbdw_kn = regexp.MustCompile("第[2二3三4四5五]|得分|地址")
  74. //且值包含以下字眼
  75. filter_zbdw_v = regexp.MustCompile("(公司|集团|研究院|设计院|局|厂|部|站|城|店|市|所|处)$|([^购]中心|办公|用品)")
  76. //且值包含以下字眼
  77. filter_zbdw_v2 = regexp.MustCompile("(公司|集团|研究院|设计院|局|厂|部|站|城|店|市|所|处)$")
  78. //Tg = map[string]interface{}{}
  79. //一些表格没有表头,是空的,对值是排序的做处理对应 NullTxBid
  80. NullTdReg = regexp.MustCompile("(首选|第[一二三四五1-5])(中标|成交)?(名(称)?|(候选|排序)?(人|单位|供应商))")
  81. NullTxtBid = "成交供应商排名"
  82. projectnameReg = regexp.MustCompile("((公开)?招标)*[((第]*[一二三四五六七八九十a-zA-Z0-9]+(标段|包|标|段)[))]*$")
  83. MhSpilt = regexp.MustCompile("[::]")
  84. //识别采购单位联系人、联系电话、代理机构联系人、联系电话
  85. ContactInfoVagueReg = regexp.MustCompile("邮政编码|邮编|(征求意见|报名审核购买)?((联系人?|办公)?((电话([//]传真)?|手机)(号码)?|邮箱(地址)?|(地(址|点)))|(联系|收料)(人(姓名)?|方式)|传真|电子邮件|(主要负责|项目(负责|联系)|(项目)?经办)人)|采购方代表")
  86. ContactInfoMustReg = regexp.MustCompile("^(" + ContactInfoVagueReg.String() + ")$")
  87. ContactType = map[string]*regexp.Regexp{
  88. "采购单位": regexp.MustCompile("(采购(项目.{2}|服务)?|比选|询价|发布人?|甲|招标(服务)?|建设|委托|发包|业主|使用|谈判|本招标项目经办|征求意见联系|项目实施)(人|单位|部门|机构|机关|(执行)?方)|(项目|建(库|设))单位|招标人信息|采购中心地址|业主|收料人"),
  89. "代理机构": regexp.MustCompile("(代理|受托).{0,2}(人|方|单位|公司|机构)|招标机构|采购代理"),
  90. }
  91. ContactBuyerPersonFilterReg = regexp.MustCompile("(管理局)$")
  92. MultipleValueSplitReg = regexp.MustCompile("[,,、\\s\u3000\u2003\u00a0]")
  93. BuyerContacts = []string{"采购单位联系人", "采购单位联系电话", "采购单位联系地址"}
  94. FilterSerial = regexp.MustCompile(".+[、..::,]")
  95. filterTableWror = regexp.MustCompile("班子成员")
  96. underline = regexp.MustCompile("_+$")
  97. iswinnertabletag = regexp.MustCompile("(中标|候选人|成交|结果)")
  98. nswinnertabletag = regexp.MustCompile("[评得分估]+")
  99. )
  100. //在解析时,判断表格元素是否隐藏
  101. func IsHide(g *goquery.Selection) (b bool) {
  102. style, exists := g.Attr("style")
  103. if exists {
  104. b = display.MatchString(style)
  105. }
  106. return
  107. }
  108. //对表格的key进行标准化处理,多个k相同时,出现覆盖问题
  109. //待扩展,暂不支持正则标签库
  110. func CommonDataAnaly(k, tabletag, tabledesc string, v interface{}) (k1 []string, weight []int, v1, returntag string, b bool) {
  111. k1 = []string{}
  112. weight = []int{}
  113. tk := k
  114. if sv, sok := v.(string); sok { //取KV
  115. v1 = sv
  116. } else if sv, sok := v.([]string); sok { //是数组先默认取第一个
  117. v1 = sv[0]
  118. }
  119. //对值单位的处理
  120. if moneyreg.MatchString(tk) {
  121. v1 += GetMoneyUnit(tk, v1)
  122. }
  123. //先清理key
  124. //u.Debug(1, k, v1)
  125. k = ClearKey(k, 2)
  126. //u.Debug(2, k)
  127. //取标准key
  128. res := u.GetTags(k)
  129. if len(res) == 0 && tk != k {
  130. res = u.GetTags(tk)
  131. }
  132. //log.Println(k, res)
  133. // if len(res) == 0 {
  134. // go u.AddtoNoMatchMap(tk)
  135. // }
  136. //当取到标准化值时,放入数组
  137. if len(res) > 0 {
  138. b = true
  139. for _, t1 := range res {
  140. k1 = append(k1, t1.Value)
  141. weight = append(weight, t1.Weight)
  142. }
  143. //k1 = res[0].Value
  144. }
  145. //没有取到标准化key时,对中标金额和中标单位的逻辑处理
  146. if !b {
  147. if filter_zbje_k.MatchString(k) && !filter_zbje_kn.MatchString(k) && filter_zbje_v.MatchString(v1) {
  148. if tabletag == "" {
  149. returntag = "中标情况"
  150. }
  151. k1 = append(k1, "中标金额")
  152. weight = append(weight, -100)
  153. b = true
  154. } else if filter_zbdw_ky.MatchString(k) && !filter_zbdw_kn.MatchString(k) &&
  155. filter_zbdw_v.MatchString(v1) {
  156. k1 = append(k1, "中标单位")
  157. weight = append(weight, -100)
  158. if tabletag == "" {
  159. returntag = "中标情况"
  160. }
  161. b = true
  162. }
  163. }
  164. //对上一步没有取到标准化key的进一步处理
  165. if !b {
  166. if tabletag == "" {
  167. }
  168. if filter_tag_zb.MatchString(tabletag) || filter_tag_zb.MatchString(tabledesc) {
  169. //u.Debug(v1, k, "-----", filter_zbdw_jd.MatchString(k), filter_zbdw_v.MatchString(v1))
  170. if filter_zbje_jd.MatchString(k) && !filter_zbje_kn.MatchString(k) && filter_zbje_v.MatchString(v1) {
  171. k1 = append(k1, "中标金额")
  172. weight = append(weight, -100)
  173. b = true
  174. } /*else if filter_zbdw_jd.MatchString(k) && filter_zbdw_v.MatchString(v1) {
  175. k1 = append(k1, "中标单位")
  176. weight = append(weight, -100)
  177. b = true
  178. }*/
  179. }
  180. }
  181. return
  182. }
  183. //对解析后的表格的kv进行过滤
  184. func (table *Table) KVFilter() {
  185. //1.标准化值查找
  186. //2.对数组的处理
  187. //3.对分包的处理
  188. //4.对KV的处理
  189. //判断表格是否有用,调用abandontable正则数组进行判断
  190. //遍历每一行
  191. winnertag := iswinnertabletag.MatchString(table.Tag) && !nswinnertabletag.MatchString(table.Tag) //table标签
  192. if !winnertag {
  193. winnertag = iswinnertabletag.MatchString(table.Tag) && !nswinnertabletag.MatchString(table.TableResult.BlockTag) //块标签
  194. }
  195. for _, tr := range table.TRs {
  196. for _, td := range tr.TDs {
  197. //fmt.Println(td.BH, td.MustBH, td.Val, td.SortKV.Map)
  198. bc := false
  199. if !td.BH {
  200. //表头是否是无用内容
  201. if td.HeadTd != nil {
  202. bc, _, _, _, _ = CheckCommon(td.HeadTd.Val, "abandontable")
  203. }
  204. }
  205. if !bc {
  206. //td元素有内嵌kv,遍历放入table的Kv中
  207. if len(td.SortKV.Keys) > 0 {
  208. for _, k3 := range td.SortKV.Keys {
  209. _val := td.SortKV.Map[k3]
  210. //thisFlag := false
  211. if td.HeadTd != nil && len([]rune(k3)) < 4 {
  212. k3 = td.HeadTd.Val + k3
  213. }
  214. if table.SortKV.Map[k3] == nil {
  215. //u.Debug(k3, _val)
  216. //if !thisFlag || (thisFlag && table.SortKV.Map[k3] == nil) {
  217. table.SortKV.AddKey(k3, _val)
  218. }
  219. }
  220. }
  221. }
  222. //td有子表格的处理
  223. //u.Debug(td.BH, td.Val, td.SonTableResult)
  224. if td.SonTableResult != nil {
  225. //u.Debug(td.SonTableResult.SortKV.Map, "-------", td.SonTableResult.Tabs)
  226. for _, k3 := range td.SonTableResult.SortKV.Keys {
  227. if table.StandKV[k3] == "" || td.SonTableResult.SortKVWeight[k3] > table.StandKVWeight[k3] {
  228. table.StandKV[k3] = qutil.ObjToString(td.SonTableResult.SortKV.Map[k3])
  229. table.StandKVWeight[k3] = td.SonTableResult.SortKVWeight[k3]
  230. }
  231. }
  232. //中标候选人排序
  233. if table.WinnerOrder == nil || len(table.WinnerOrder) == 0 {
  234. table.WinnerOrder = td.SonTableResult.WinnerOrder
  235. } else {
  236. winnerOrderEntity.Merge(table.WinnerOrder, td.SonTableResult.WinnerOrder)
  237. }
  238. }
  239. }
  240. }
  241. as := NewSortMap()
  242. //表格描述处理,对成交结果的处理
  243. for _, k := range table.SortKV.Keys {
  244. if regexp.MustCompile("(成交|中标|候选|排名|名次|供应商排序)").MatchString(k) {
  245. table.Desc += "成交结果,"
  246. }
  247. }
  248. //遍历table.sortkv,进行过滤处理,并放入标准化KV中,如果值是数组跳到下一步处理
  249. for _, k := range table.SortKV.Keys {
  250. if regexp.MustCompile("^单价").MatchString(k) {
  251. continue
  252. }
  253. v := table.SortKV.Map[k]
  254. if _, ok := v.(string); ok {
  255. k = regSpliteSegment.ReplaceAllString(regReplAllSpace.ReplaceAllString(k, ""), "")
  256. k1, w1, v1, tag, b := CommonDataAnaly(k, table.Tag, table.Desc, v)
  257. //qutil.Debug(k, v, k1, w1, v1, tag, b)
  258. if b {
  259. //降低冒号值的权重
  260. if MhSpilt.MatchString(v1) {
  261. for pos, _ := range k1 {
  262. w1[pos] -= 50
  263. }
  264. }
  265. if tag != "" && table.Tag == "" {
  266. table.Tag = tag
  267. }
  268. for pos, k2 := range k1 {
  269. if table.StandKV[k2] == "" || w1[pos] > table.StandKVWeight[k2] {
  270. table.StandKV[k2] = v1 //本节点
  271. table.StandKVWeight[k2] = w1[pos]
  272. }
  273. // else if k2 == "中标金额" {
  274. // // u.Debug(qutil.Float64All(v1), qutil.Float64All(table.StandKV[k2]))
  275. // if qutil.Float64All(v1) > qutil.Float64All(table.StandKV[k2]) {
  276. // table.StandKV[k2] = v1
  277. // }
  278. // }
  279. }
  280. }
  281. } else {
  282. //u.Debug(k, v, "---------")
  283. as.AddKey(k, v)
  284. }
  285. }
  286. //处理值是数组的kv放入标准化kv中
  287. checkKey := map[int]bool{}
  288. for kn, k := range as.Keys {
  289. v := as.Map[k]
  290. if vm, ok := v.([]map[string]interface{}); ok && k == NullTxtBid {
  291. if table.WinnerOrder == nil {
  292. table.WinnerOrder = []map[string]interface{}{}
  293. }
  294. table.WinnerOrder = append(table.WinnerOrder, vm...)
  295. } else {
  296. //增加候选人排序逻辑
  297. if table.WinnerOrder == nil && !checkKey[kn] {
  298. if vs1, ok := v.([]string); ok {
  299. smap := make([]map[string]interface{}, len(vs1))
  300. for n1, _ := range vs1 {
  301. smap[n1] = map[string]interface{}{}
  302. }
  303. //hadSort := false
  304. tmpEntname := make([]string, len(vs1))
  305. tmpPrice := make([]string, len(vs1))
  306. for kn1, k := range as.Keys[kn:] {
  307. v := as.Map[k]
  308. if ContactType["采购单位"].MatchString(k) || ContactType["代理机构"].MatchString(k) {
  309. continue
  310. }
  311. //目前对数组数据的key做判断,但是某些额可以是不满足情况的
  312. //载明内容:[第一中标候选人 第二中标候选人] id:5d00587da5cb26b9b75e367b
  313. if vs, ok := v.([]string); ok && len(vs) == len(vs1) { //数组值的个数相同
  314. res, _, _, _, repl := CheckCommon(k, "bidorder")
  315. kv := ""
  316. if !res {
  317. kt := u.GetTags(filterThText.ReplaceAllString(ClearKey(k, 2), ""))
  318. if kt.Len() > 0 {
  319. kv = kt[0].Value
  320. }
  321. }
  322. //qutil.Debug(k, res, repl, kv, "--", vs)
  323. if !res && kv == "" { //key未验证出,验证数组的val值
  324. checkKey[kn+kn1] = true
  325. if winnertag { //如果是中标信息 在根据val数组信息解析候选人
  326. for vsk, vsv := range vs {
  327. if NullTdReg.MatchString(vsv) { //数据先验证val是否有排序
  328. //hadSort = true
  329. smap[vsk]["sortstr"] = vsv
  330. smap[vsk]["sort"] = GetBidSort(vsv, vsk+1)
  331. } else if findCandidate2.MatchString(vsv) && tmpEntname[vsk] == "" { //数据验证val是否是候选人
  332. entname, _ := winnerOrderEntity.clear("中标单位", vsv).(string)
  333. if entname != "" {
  334. tmpEntname[vsk] = entname
  335. }
  336. } else { //验证val时如果数组中的第一条数据既不满足sort或者entname 判定此数组数据错误
  337. break
  338. }
  339. }
  340. }
  341. }
  342. if res || kv != "" { //连续往下找几个key
  343. checkKey[kn+kn1] = true
  344. SORT:
  345. if repl == "sort" {
  346. //hadSort = true
  347. for vsk, vsv := range vs {
  348. smap[vsk]["sortstr"] = vsv
  349. smap[vsk]["sort"] = GetBidSort(vsv, vsk+1)
  350. }
  351. } else if repl == "entname" || kv == "中标单位" {
  352. for vsk, vsv := range vs {
  353. if winnerReg6.MatchString(vsv) { //k:中标候选人 v:["第一名","第二名"]
  354. repl = "sort"
  355. goto SORT
  356. }
  357. // if entname, _ := smap[vsk]["entname"].(string); entname != "" || len([]rune(vsv)) < 3 {
  358. // break
  359. // }
  360. // entname, _ := winnerOrderEntity.clear("中标单位", vsv).(string)
  361. // if entname != "" {
  362. // smap[vsk]["entname"] = entname
  363. //
  364. if tmpEntname[vsk] != "" || len([]rune(vsv)) < 4 { //排除 单位:["台","个","套"]
  365. break
  366. }
  367. entname, _ := winnerOrderEntity.clear("中标单位", vsv).(string)
  368. if entname != "" {
  369. tmpEntname[vsk] = entname
  370. }
  371. }
  372. } else if kv == "中标金额" {
  373. for vsk, vsv := range vs {
  374. //过滤price 2348273.432元(万元)-->2348273.432
  375. //tmp1, _ := smap[vsk]["price"].(string)
  376. tmp1 := tmpPrice[vsk]
  377. p1num := numberReg2.FindString(tmp1)
  378. p2num := numberReg2.FindString(vsv)
  379. p1 := qutil.Float64All(p1num)
  380. p2 := qutil.Float64All(p2num)
  381. if p2 > p1 {
  382. //smap[vsk]["price"] = winnerOrderEntity.clear("中标金额", vsv+GetMoneyUnit(k, vsv))
  383. price := winnerOrderEntity.clear("中标金额", vsv+GetMoneyUnit(k, vsv))
  384. if pricestr, _ := price.(string); len(pricestr) < 30 && len(pricestr) > 0 {
  385. tmpPrice[vsk] = pricestr
  386. }
  387. }
  388. }
  389. }
  390. }
  391. } else {
  392. //break
  393. }
  394. }
  395. newSmap := []map[string]interface{}{}
  396. //qutil.Debug("smap=======", smap)
  397. //qutil.Debug("tmpEntname--", len(tmpEntname), tmpEntname)
  398. //qutil.Debug("tmpPrice--", len(tmpPrice), tmpPrice)
  399. for n, smap_v := range smap {
  400. //if hadSort { //有排序,再添加entname和price
  401. if len(tmpEntname) > 0 && n < len(tmpEntname) && tmpEntname[n] != "" {
  402. smap_v["entname"] = tmpEntname[n]
  403. if len(tmpPrice) > 0 && n < len(tmpPrice) && tmpPrice[n] != "" {
  404. smap_v["price"] = tmpPrice[n]
  405. }
  406. }
  407. //} else if len(tmpEntname) > 0 {
  408. //fmt.Println("table winnerorder only has entname", tmpEntname)
  409. //}
  410. if len(smap_v) > 2 { //只有排序信息 sort和sortstr
  411. newSmap = append(newSmap, smap_v)
  412. }
  413. }
  414. if len(newSmap) > 0 {
  415. table.WinnerOrder = newSmap
  416. }
  417. }
  418. }
  419. k1, w1, v1, tag, b := CommonDataAnaly(k, table.Tag, table.Desc, v)
  420. if b {
  421. if tag != "" && table.Tag == "" {
  422. table.Tag = tag
  423. }
  424. for pos, k2 := range k1 {
  425. if table.StandKV[k2] == "" || w1[pos] > table.StandKVWeight[k2] {
  426. table.StandKV[k2] = v1 //本节点
  427. table.StandKVWeight[k2] = w1[pos]
  428. }
  429. // else if k2 == "中标金额" {
  430. // if qutil.Float64All(v1) > qutil.Float64All(table.StandKV[k2]) {
  431. // table.StandKV[k2] = v1
  432. // }
  433. // }
  434. }
  435. }
  436. }
  437. }
  438. //
  439. if filterTableWror.MatchString(table.Tag) {
  440. table.WinnerOrder = nil
  441. }
  442. //
  443. if len(table.WinnerOrder) > 0 || !table.BPackage {
  444. winnerOrder := []map[string]interface{}{}
  445. maxSort := 0
  446. //调整顺序
  447. for i := 0; i < 2; i++ {
  448. for _, v := range table.WinnerOrder {
  449. sortstr, _ := v["sortstr"].(string)
  450. if (i == 0 && sortstr == "") || (i == 1 && sortstr != "") {
  451. continue
  452. }
  453. sort, _ := v["sort"].(int)
  454. if i == 0 {
  455. if maxSort == 0 || sort > maxSort {
  456. maxSort = sort
  457. }
  458. } else {
  459. maxSort++
  460. v["sort"] = maxSort
  461. }
  462. winnerOrder = append(winnerOrder, v)
  463. }
  464. if len(winnerOrder) == len(table.WinnerOrder) {
  465. break
  466. }
  467. }
  468. table.WinnerOrder = winnerOrder
  469. winnerOrder = []map[string]interface{}{}
  470. L:
  471. for _, tr := range table.TRs {
  472. for _, td := range tr.TDs {
  473. winnerOrder = winnerOrderEntity.Find(td.Val, true, 3)
  474. if len(winnerOrder) > 0 {
  475. break L
  476. }
  477. }
  478. }
  479. if len(table.WinnerOrder) > 0 {
  480. //中标候选人合并
  481. winnerOrderEntity.Merge(table.WinnerOrder, winnerOrder)
  482. if table.StandKV["中标单位"] == "" {
  483. ent := table.WinnerOrder[0]["entname"]
  484. if ent != nil {
  485. table.StandKV["中标单位"], _ = ent.(string)
  486. table.StandKVWeight["中标单位"] = -25
  487. }
  488. }
  489. } else if !table.BPackage { //没有table.WinnerOrder也没有分包 将td中的WinnerOrder赋值给table.WinnerOrder
  490. if len(winnerOrder) > 1 {
  491. table.WinnerOrder = winnerOrder
  492. }
  493. }
  494. }
  495. //对中标候选人进行排序
  496. winnerOrderEntity.Order(table.WinnerOrder)
  497. //该表格有一个分包,并且有中标候选人排序的情况下,把中标候选人放到包里面
  498. if table.BlockPackage != nil && table.BlockPackage.Keys != nil && len(table.BlockPackage.Keys) == 1 {
  499. if table.BlockPackage.Map != nil {
  500. onePkgKey := table.BlockPackage.Keys[0]
  501. onePkg, _ := table.BlockPackage.Map[onePkgKey].(*u.BlockPackage)
  502. if onePkg != nil && onePkg.WinnerOrder != nil && len(onePkg.WinnerOrder) == 0 {
  503. onePkg.WinnerOrder = table.WinnerOrder
  504. table.BlockPackage.Map[onePkgKey] = onePkg
  505. }
  506. }
  507. }
  508. }
  509. //表格结果合并到父表格集中
  510. func (table *Table) MergerToTableresult() {
  511. //对多包表格的多包值的合并处理
  512. if table.BPackage {
  513. table.TableResult.IsMultiPackage = true
  514. for k, v := range table.BlockPackage.Map {
  515. package1 := table.TableResult.PackageMap.Map[k]
  516. if package1 == nil {
  517. table.TableResult.PackageMap.AddKey(k, v)
  518. } else {
  519. bp := package1.(*u.BlockPackage)
  520. if bp.TableKV == nil {
  521. bp.TableKV = u.NewJobKv()
  522. }
  523. v1 := v.(*u.BlockPackage)
  524. if v1.TableKV != nil && v1.TableKV.Kv != nil {
  525. for k2, v2 := range v1.TableKV.Kv {
  526. if bp.TableKV == nil {
  527. bp.TableKV = u.NewJobKv()
  528. }
  529. if bp.TableKV.Kv[k2] == "" || (v1.TableKV.KvTag[k2] != nil && bp.TableKV.KvTag[k2] != nil && v1.TableKV.KvTag[k2].Weight > bp.TableKV.KvTag[k2].Weight) {
  530. //可能会报错 assignment to entry in nil map
  531. bp.TableKV.Kv[k2] = v2
  532. bp.Text += fmt.Sprintf("%v:%v\n", k2, v2)
  533. }
  534. }
  535. }
  536. bp.WinnerOrder = v1.WinnerOrder
  537. //table.TableResult.PackageMap.AddKey(k, v)
  538. }
  539. }
  540. // str := ""
  541. // for _, k := range table.TableResult.PackageMap.Keys {
  542. // v := table.TableResult.PackageMap.Map[k].(*u.BlockPackage)
  543. // str += fmt.Sprintf("包号:%s,中标人:%s,中标价:%s,预算:%s,文本:%s,排名:%v ---\t", v.Index, v.TableKV["中标单位"]+v.ColonKV["中标单位"], v.TableKV["中标金额"]+v.ColonKV["中标金额"], v.TableKV["预算"]+v.ColonKV["预算"], v.Text, v.WinnerOrder)
  544. // }
  545. // u.Debug(table, table.TableResult, str)
  546. }
  547. //遍历标准key到tableresult.sortkv中
  548. for k, v := range table.StandKV {
  549. if table.TableResult.SortKV.Map[k] == nil || table.StandKVWeight[k] > table.TableResult.SortKVWeight[k] || strings.Contains(table.Tag, "变更") {
  550. v = strings.Replace(v, "__", "", -1)
  551. if table.TableResult.SortKV.Map[k] == nil {
  552. table.TableResult.SortKV.AddKey(k, v) //父集
  553. } else {
  554. table.TableResult.SortKV.ReplaceKey(k, v, k)
  555. }
  556. table.TableResult.SortKVWeight[k] = table.StandKVWeight[k]
  557. } else if table.TableResult.SortKV.Map[k] != nil {
  558. //u.Debug(k, v, table.TableResult.SortKV.Map[k], "..............")
  559. }
  560. }
  561. //表格的块标签
  562. if table.TableResult.BlockTag == "" && table.Tag != "" {
  563. table.TableResult.BlockTag = table.Tag
  564. }
  565. //中标候选人(多个table,现在默认取第一个table的信息,考虑需不需要多个table分析合并数据?)
  566. if table.TableResult.WinnerOrder == nil || len(table.TableResult.WinnerOrder) == 0 {
  567. table.TableResult.WinnerOrder = table.WinnerOrder
  568. }
  569. //增加brand 并列table
  570. if len(table.BrandData) > 0 {
  571. for _, v := range table.BrandData {
  572. if len(v) > 0 {
  573. table.TableResult.BrandData = append(table.TableResult.BrandData, v)
  574. }
  575. }
  576. }
  577. }
  578. /**
  579. 解析表格入口
  580. 返回:汇总表格对象
  581. **/
  582. func AnalyTableV2(tabs []*goquery.Selection, toptype, blockTag, con string, itype int, _id interface{}) (tabres *TableResult) {
  583. defer qutil.Catch()
  584. //u.Debug(con)
  585. if itype == 1 {
  586. //修复表格
  587. con = RepairCon(con)
  588. }
  589. //生成tableresult对象
  590. tabres = NewTableResult(_id, toptype, blockTag, con, itype)
  591. //可以有多个table
  592. for _, table := range tabs {
  593. //隐藏表格跳过
  594. if IsHide(table) {
  595. continue
  596. }
  597. tabres.GoqueryTabs = append(tabres.GoqueryTabs, table)
  598. }
  599. //解析表格集
  600. tabres.Analy()
  601. return
  602. }
  603. //开始解析表格集
  604. func (ts *TableResult) Analy() {
  605. tabs := []*Table{}
  606. contactFormat := &u.ContactFormat{
  607. IndexMap: map[int]string{},
  608. MatchMap: map[string]map[string]bool{},
  609. }
  610. for _, table := range ts.GoqueryTabs {
  611. tn := NewTable(ts.Html, ts, table)
  612. //核心模块
  613. ts := tn.Analy(contactFormat)
  614. for _, tab := range ts {
  615. tabs = append(tabs, tab)
  616. //fmt.Println("tab.SortKV.Map", tab.SortKV.Keys)
  617. }
  618. //tn.SonTables = append(tn.SonTables, tn)
  619. }
  620. //统一合并,考虑统一多表格是多包的情况---新增
  621. if len(tabs) > 1 {
  622. pns := map[string]string{}
  623. pnarr := []string{}
  624. for _, table := range tabs {
  625. pn := table.StandKV["项目名称"]
  626. if pn != "" && TitleReg.MatchString(pn) {
  627. pnarr = append(pnarr, pn)
  628. matchres := TitleReg.FindAllStringSubmatch(pn, -1)
  629. if len(matchres) == 1 && len(matchres[0]) > 0 {
  630. v1 := u.PackageNumberConvert(matchres[0][0])
  631. pns[v1] = matchres[0][0]
  632. bp := &u.BlockPackage{}
  633. bp.Index = v1
  634. bp.Origin = matchres[0][0]
  635. bp.TableKV = u.NewJobKv()
  636. for _, k := range []string{"中标金额", "中标单位", "预算", "成交状态", "项目名称", "项目编号", "采购范围"} {
  637. bp.TableKV.Kv[k] = table.StandKV[k]
  638. }
  639. bp.WinnerOrder = table.WinnerOrder
  640. if table.BlockPackage.Map[v1] == nil {
  641. table.BPackage = true
  642. table.BlockPackage.AddKey(v1, bp)
  643. }
  644. }
  645. }
  646. }
  647. if len(tabs) == len(pns) {
  648. //多个表格,每个表格都是一个分包 http://www.cxzwfw.gov.cn/info/1009/6963.htm
  649. //项目名称、项目编号、采购单位、招标机构、预算
  650. pname := projectnameReg.ReplaceAllString(pnarr[0], "")
  651. btrue := true
  652. for _, pn := range pnarr[1:] {
  653. pn = projectnameReg.ReplaceAllString(pn, "")
  654. //u.Debug(pn, pname)
  655. if pn != pname {
  656. //项目名称不一致
  657. btrue = false
  658. break
  659. }
  660. }
  661. if btrue {
  662. ts.SortKV.AddKey("项目名称", pname)
  663. ts.SortKVWeight["项目名称"] = 100
  664. for _, table := range tabs {
  665. table.BPackage = true
  666. //预算、中标金额、NullTxtBid成交供应商排名 中标单位 成交状态
  667. if table.BlockPackage != nil && len(table.BlockPackage.Keys) == 1 {
  668. bp := table.BlockPackage.Map[table.BlockPackage.Keys[0]].(*u.BlockPackage)
  669. if table.TableResult.WinnerOrder != nil {
  670. bp.WinnerOrder = table.WinnerOrder
  671. }
  672. if bp != nil && table.StandKV != nil {
  673. if bp.TableKV == nil {
  674. bp.TableKV = u.NewJobKv()
  675. }
  676. for nk, k := range []string{"中标金额", "中标单位", "预算", "成交状态", "项目名称", "项目编号", "采购范围"} {
  677. bp.TableKV.Kv[k] = table.StandKV[k]
  678. if nk < 4 {
  679. delete(table.StandKV, k)
  680. }
  681. }
  682. }
  683. }
  684. }
  685. }
  686. }
  687. }
  688. for _, table := range tabs {
  689. table.MergerToTableresult()
  690. // for k, v := range table.TableResult.SortKV.Map {
  691. // qutil.Debug(k, "=====", v)
  692. // }
  693. }
  694. }
  695. //解析表格
  696. func (table *Table) Analy(contactFormat *u.ContactFormat) []*Table {
  697. //查找表体中的tr对象
  698. trs := table.Goquery.ChildrenFiltered("tbody,thead,tfoot").ChildrenFiltered("tr")
  699. if trs.Size() == 0 {
  700. trs = table.Goquery.ChildrenFiltered("tr")
  701. }
  702. //num := 0
  703. //遍历tr数组
  704. trs.Each(func(n int, sel *goquery.Selection) {
  705. //隐藏行不处理
  706. if IsHide(sel) {
  707. return
  708. }
  709. //遍历每行的td
  710. tds := sel.ChildrenFiltered("td,th")
  711. TR := NewTR(table)
  712. tdTextIsNull := true
  713. tds.Each(func(m int, selm *goquery.Selection) {
  714. //对隐藏列不处理!!!
  715. if IsHide(selm) {
  716. return
  717. }
  718. //进入每一个单元格
  719. td := NewTD(selm, TR, table)
  720. //num++
  721. TR.AddTD(td)
  722. if td.Val != "" { //删除一个tr,tr中所有td是空值的
  723. tdTextIsNull = false
  724. }
  725. })
  726. //tr中所有td的内容为空 将tr删除
  727. if !tdTextIsNull {
  728. table.AddTR(TR)
  729. }
  730. })
  731. //重置行列
  732. table.ComputeRowColSpan()
  733. // for n, tr := range table.TRs {
  734. // for m, td := range tr.TDs {
  735. // qutil.Debug(td.BH, n, m, td.Text, td.StartRow, td.EndRow, td.StartCol, td.EndCol)
  736. // }
  737. // }
  738. tm := []map[string]interface{}{}
  739. tmk := map[string]bool{}
  740. tmn := map[int]map[string]interface{}{}
  741. for rownum, tr := range table.TRs {
  742. if len(tr.TDs) == 1 && table.ColNum > 1 {
  743. td := tr.TDs[0]
  744. if td.StartCol == 0 && td.EndCol+1 == table.ColNum && len([]rune(td.Val)) > 1 && len([]rune(td.Val)) < 50 {
  745. con, m1, b := CheckMultiPackage(td.Val, "")
  746. if b {
  747. for k, _ := range m1 {
  748. numstr := u.PackageNumberConvert(k)
  749. m2 := map[string]interface{}{
  750. "tag": con,
  751. //"num": numstr,
  752. //"numtxt": v[0],
  753. "startrow": rownum,
  754. }
  755. tmk[numstr] = true
  756. tmn[rownum] = m2
  757. tm = append(tm, m2)
  758. break
  759. }
  760. }
  761. }
  762. }
  763. }
  764. //拆表
  765. ts := []*Table{}
  766. if len(tmk) > 1 && len(tmk) == len(tm) {
  767. var tab1 *Table
  768. for rownum, tr := range table.TRs {
  769. if tab1 == nil {
  770. tab1 = NewTable("", table.TableResult, table.Goquery)
  771. tab1.BSplit = true
  772. if tmn[rownum] != nil {
  773. tab1.StandKV["项目名称"] = tmn[rownum]["tag"].(string)
  774. tab1.StandKVWeight["项目名称"] = -100
  775. }
  776. ts = append(ts, tab1)
  777. }
  778. if tmn[rownum] != nil {
  779. tab1.Tag = tmn[rownum]["tag"].(string)
  780. } else {
  781. tab1.AddTR(tr)
  782. }
  783. if tmn[rownum+1] != nil {
  784. tab1 = nil
  785. }
  786. }
  787. } else {
  788. ts = append(ts, table)
  789. }
  790. for n, table := range ts {
  791. if len(table.TRs) > 0 {
  792. //删除尾部空行
  793. for len(table.TRs) > 0 {
  794. npos := len(table.TRs)
  795. tailTR := table.TRs[npos-1] //最后一个tr
  796. bspace := true
  797. for _, v := range tailTR.TDs {
  798. if v.Val != "" || v.SonTableResult != nil || len(v.SortKV.Keys) > 0 {
  799. bspace = false
  800. break
  801. }
  802. }
  803. if bspace {
  804. table.TRs = table.TRs[:npos-1]
  805. } else {
  806. break
  807. }
  808. }
  809. //table.Print()
  810. //校对表格
  811. table.Adjust()
  812. //查找表格的标签
  813. table.FindTag()
  814. //log.Println(table.TableResult.Id, table.Html)
  815. //分割表格
  816. if table.BSplit {
  817. if !table.BHeader && n > 0 {
  818. for i := n - 1; i > -1; i-- {
  819. if ts[i].BHeader {
  820. if ts[i].BFirstRow {
  821. //取第一行插入到
  822. table.InsertTR(ts[i].TRs[0])
  823. table.Adjust()
  824. }
  825. break
  826. }
  827. }
  828. }
  829. }
  830. //对没有表头表格的处理
  831. _, _, b := CheckMultiPackage(table.Tag, "")
  832. if b {
  833. table.StandKV["项目名称"] = table.Tag
  834. table.StandKVWeight["项目名称"] = -100
  835. }
  836. table.TdContactFormat(contactFormat)
  837. //开始查找kv,核心模块
  838. table.FindKV()
  839. //table中抽取品牌
  840. if u.IsBrandGoods {
  841. table.analyBrand()
  842. }
  843. //判断是否是多包,并处理分包的
  844. table.CheckMultiPackageByTable()
  845. str := "\n"
  846. for k, v := range table.StandKV {
  847. str += fmt.Sprintf("_==___%s:%v\n", k, v)
  848. if table.TableResult.SortKV.Map[k] == nil {
  849. table.TableResult.SortKV.AddKey(k, v)
  850. table.TableResult.SortKVWeight[k] = table.StandKVWeight[k]
  851. }
  852. }
  853. res, _, _, _, _ := CheckCommon(table.Tag, "abandontable")
  854. if !res {
  855. //过滤、标准化、合并kv
  856. table.KVFilter()
  857. }
  858. str = "\n"
  859. for k, v := range table.StandKV {
  860. str += fmt.Sprintf("_____%s:%v\n", k, v)
  861. if table.TableResult.SortKV.Map[k] == nil {
  862. table.TableResult.SortKV.AddKey(k, v)
  863. table.TableResult.SortKVWeight[k] = table.StandKVWeight[k]
  864. }
  865. }
  866. //u.Debug(str)
  867. }
  868. }
  869. return ts
  870. }
  871. func (table *Table) Adjust() {
  872. table.TDNum = func() int {
  873. n := 0
  874. for _, tr := range table.TRs {
  875. n += len(tr.TDs)
  876. }
  877. return n
  878. }()
  879. //有多少行
  880. table.RowNum = len(table.TRs)
  881. // for k1, tr := range table.TRs {
  882. // for k2, td := range tr.TDs {
  883. // qutil.Debug(k1, k2, td.Val, td.Rowspan, td.Colspan, td.ColPos, tr.RowPos)
  884. // }
  885. // }
  886. //计算行列起止位置,跨行跨列处理
  887. table.ComputeRowColSpan()
  888. // for k1, tr := range table.TRs {
  889. // for k2, td := range tr.TDs {
  890. // qutil.Debug(k1, k2, td.Val, td.StartRow, td.EndRow, td.StartCol, td.EndCol)
  891. // }
  892. // }
  893. //大概计算每个起止行列的概率
  894. table.GetKeyRation()
  895. /*
  896. for k, v := range table.StartAndEndRation {
  897. for k1, v1 := range v.Poss {
  898. bs, _ := json.Marshal(v1)
  899. str := ""
  900. for _, td := range v.Tdmap[v1] {
  901. str += "__" + td.Val + fmt.Sprintf("%d_%d_%d_%d", td.StartRow, td.EndRow, td.StartCol, td.EndCol)
  902. }
  903. qutil.Debug(k, k1, string(bs), v.Rationmap[v1], str)
  904. }
  905. }
  906. */
  907. //u.Debug("tdnum:", num, table.RowNum, table.ColNum)
  908. //是否是规则的表格,单元各个数=行数*列数
  909. table.Brule = table.TDNum == table.RowNum*table.ColNum
  910. count := 0
  911. for _, trs := range table.TRs {
  912. for _, td := range trs.TDs {
  913. if td.BH {
  914. count++
  915. }
  916. }
  917. }
  918. if float32(count)/float32(table.TDNum) < 0.85 {
  919. //精确计算起止行列是表头的概率
  920. table.ComputeRowColIsKeyRation()
  921. bhead := false
  922. L:
  923. for i, tr := range table.TRs {
  924. for _, td := range tr.TDs {
  925. if td.BH {
  926. //qutil.Debug("----=====---", td.Val, len(table.TRs[len(table.TRs)-1].TDs), i, len(table.TRs)-1)
  927. if i == len(table.TRs)-1 && len(table.TRs[len(table.TRs)-1].TDs) == 2 {
  928. res, _, _, _, _ := CheckCommon(td.Val, "abandontable")
  929. if res {
  930. //删除此行
  931. table.TRs = table.TRs[:len(table.TRs)-1]
  932. table.Adjust()
  933. return
  934. }
  935. }
  936. bhead = true
  937. break L
  938. }
  939. }
  940. }
  941. table.BHeader = bhead
  942. }
  943. }
  944. //计算行/列表格的结束位置 StartRow=0 EndRow=0
  945. func (table *Table) ComputeRowColSpan() {
  946. mapRC := map[int]map[int]int{} //记录第几行pos,起始列对应的合并值
  947. for k, v := range table.TRs {
  948. nk := 0 //nk列的起始,k行的起始||如果有合并,起始就不是0
  949. ball := true
  950. rowspans := v.TDs[0].Rowspan //某一行第一个td的rowspan
  951. for _, v1 := range v.TDs {
  952. if v1.Rowspan != rowspans {
  953. ball = false
  954. break
  955. }
  956. }
  957. for _, v1 := range v.TDs {
  958. if ball {
  959. v1.Rowspan = 1
  960. }
  961. mc := mapRC[k]
  962. for {
  963. if mc != nil && mc[nk] > 0 {
  964. nk += mc[nk]
  965. } else {
  966. break
  967. }
  968. }
  969. v1.StartCol = nk
  970. nk += v1.Colspan - 1
  971. v1.EndCol = nk
  972. if nk >= table.ColNum {
  973. table.ColNum = nk + 1
  974. }
  975. nk++
  976. v1.StartRow = k
  977. v1.EndRow = k + v1.Rowspan - 1
  978. ck := fmtkey("c", v1.StartCol, v1.EndCol)
  979. tdcs := table.StartAndEndRation[ck]
  980. if tdcs == nil {
  981. tdcs = NewTDRationScope(ck)
  982. table.StartAndEndRation[ck] = tdcs
  983. table.StartAndEndRationKSort.AddKey(ck, 1)
  984. }
  985. tdcs.Addtd(v1)
  986. rk := fmtkey("r", v1.StartRow, v1.EndRow)
  987. tdrs := table.StartAndEndRation[rk]
  988. if tdrs == nil {
  989. tdrs = NewTDRationScope(rk)
  990. table.StartAndEndRation[rk] = tdrs
  991. table.StartAndEndRationKSort.AddKey(rk, 1)
  992. }
  993. tdrs.Addtd(v1)
  994. if v1.Rowspan > 1 {
  995. for i := 1; i < v1.Rowspan; i++ {
  996. r := k + i
  997. if r < len(table.TRs) {
  998. mc := mapRC[r]
  999. if mc == nil {
  1000. mc = map[int]int{}
  1001. }
  1002. mc[v1.StartCol] = v1.Colspan
  1003. mapRC[r] = mc
  1004. }
  1005. }
  1006. }
  1007. }
  1008. }
  1009. }
  1010. func fmtkey(t string, start, end int) string {
  1011. return fmt.Sprintf("%s_%d_%d", t, start, end)
  1012. }
  1013. func (table *Table) FindTag() {
  1014. //查找每个table的标签,如果有标签可按标签处理,否则根据表格去判断
  1015. if table.Tag != "" {
  1016. return
  1017. }
  1018. t1, _ := table.Goquery.OuterHtml()
  1019. html := table.Html
  1020. pos := strings.Index(html, t1)
  1021. if pos <= 0 {
  1022. doc, _ := goquery.NewDocumentFromReader(strings.NewReader(table.Html))
  1023. html, _ = doc.Html()
  1024. pos = strings.Index(html, t1)
  1025. }
  1026. //u.Debug("--------", t1, "====\n\n\n\n=====", html)
  1027. if pos > 0 {
  1028. tcon := html[:pos]
  1029. tcon = cut.ClearHtml(tcon)
  1030. tcon = ClearTagReg.ReplaceAllString(tcon, "")
  1031. //u.Debug(pos, "-----------", tcon)
  1032. strs := ttagreg.FindStringSubmatch(tcon)
  1033. if len(strs) > 0 {
  1034. table.Tag = strs[0]
  1035. //u.Debug(table.Tag)
  1036. }
  1037. }
  1038. if table.Tag == "" {
  1039. table.Tag = table.TableResult.BlockTag
  1040. }
  1041. //u.Debug(table.Tag)
  1042. }
  1043. //计算r/c_start_end的概率
  1044. func (table *Table) GetKeyRation() {
  1045. for _, vn := range table.StartAndEndRationKSort.Keys {
  1046. v := table.StartAndEndRation[vn]
  1047. for _, v1 := range v.Poss {
  1048. count := 0
  1049. n := 0
  1050. for _, td := range v.Tdmap[v1] {
  1051. n++
  1052. if td.BH {
  1053. count++
  1054. }
  1055. }
  1056. v.Rationmap[v1] = float32(count) / float32(n)
  1057. }
  1058. }
  1059. }
  1060. //计算行列是表头的概率调用GetKeyRation
  1061. func (table *Table) ComputeRowColIsKeyRation() {
  1062. //增加对跨行校正限止
  1063. // u.Debug(table.Brule, table.ColNum, table.RowNum, table.TDNum)
  1064. bkeyfirstrow := false
  1065. bkeyfirstcol := false
  1066. if table.Brule { //不存在跨行跨列的情况,规则表格
  1067. checkCompute := map[string]bool{}
  1068. for k, tr := range table.TRs {
  1069. rk := fmtkey("r", tr.TDs[0].StartRow, tr.TDs[0].EndRow)
  1070. if k == 0 { //第1行的概率
  1071. ck := fmtkey("c", tr.TDs[0].StartCol, tr.TDs[0].EndCol)
  1072. //u.Debug(table.BFirstRow, "--", table.StartAndEndRation[rk], table.StartAndEndRation[ck])
  1073. ration1, _ := table.StartAndEndRation[rk].GetTDRation(tr.TDs[0])
  1074. ration2, _ := table.StartAndEndRation[ck].GetTDRation(tr.TDs[0])
  1075. if (len(tr.TDs) == 2 && ration2 < 0.55) && (len(tr.TDs) == 2 && ration1 > 0.5) { //第一行为key
  1076. bkeyfirstrow = true
  1077. ball := true
  1078. for _, td := range tr.TDs {
  1079. if MoneyReg.MatchString(td.Val) {
  1080. bkeyfirstrow = false
  1081. ball = false
  1082. td.BH = false
  1083. break
  1084. }
  1085. }
  1086. for _, td := range tr.TDs {
  1087. if ball {
  1088. td.BH = true
  1089. td.KeyDirect = 1
  1090. td.KVDirect = 2
  1091. }
  1092. }
  1093. } else if ration2 > 0.55 { //第1列
  1094. bkeyfirstcol = true
  1095. if !checkCompute[ck] {
  1096. checkCompute[ck] = true
  1097. //重置第1列
  1098. for _, tr1 := range table.TRs {
  1099. for _, td1 := range tr1.TDs {
  1100. if td1.StartCol == 0 {
  1101. if !MoneyReg.MatchString(td1.Val) {
  1102. td1.BH = true
  1103. td1.KeyDirect = 2
  1104. td1.KVDirect = 1
  1105. }
  1106. }
  1107. }
  1108. }
  1109. }
  1110. }
  1111. if !bkeyfirstrow && !bkeyfirstcol {
  1112. if len(tr.TDs) > 1 && ration1 > ration2 && ration1 > 0.5 {
  1113. bkeyfirstrow = true
  1114. for _, td := range tr.TDs {
  1115. if !MoneyReg.MatchString(td.Val) {
  1116. td.BH = true
  1117. td.KeyDirect = 1
  1118. td.KVDirect = 2
  1119. }
  1120. }
  1121. } else if tr.Table.ColNum > 1 && ration2 > 0.5 {
  1122. bkeyfirstcol = true
  1123. if !checkCompute[ck] {
  1124. checkCompute[ck] = true
  1125. //重置第1列
  1126. for _, tr1 := range table.TRs {
  1127. for _, td1 := range tr1.TDs {
  1128. if td1.StartCol == 0 {
  1129. if !MoneyReg.MatchString(td1.Val) {
  1130. td1.BH = true
  1131. td1.KeyDirect = 2
  1132. td1.KVDirect = 1
  1133. }
  1134. }
  1135. }
  1136. }
  1137. }
  1138. }
  1139. }
  1140. } else {
  1141. if bkeyfirstrow {
  1142. //第一列的概率
  1143. ration1, _ := table.StartAndEndRation[rk].GetTDRation(tr.TDs[0])
  1144. if k == 1 || ration1 < checkval {
  1145. for _, td := range tr.TDs {
  1146. if !td.MustBH {
  1147. td.BH = false
  1148. td.KeyDirect = 0
  1149. td.KVDirect = 0
  1150. }
  1151. }
  1152. } //else {for _, td := range tr.TDs {}}
  1153. } else {
  1154. //列在起作用
  1155. if bkeyfirstcol {
  1156. for _, td := range tr.TDs {
  1157. ck := fmtkey("c", td.StartCol, td.EndCol)
  1158. ration1, _ := table.StartAndEndRation[ck].GetTDRation(td)
  1159. if !checkCompute[ck] {
  1160. checkCompute[ck] = true
  1161. if ration1 >= checkval && td.ColPos != 1 {
  1162. for _, tr1 := range table.TRs {
  1163. for _, td1 := range tr1.TDs {
  1164. if td1.StartCol == td.StartCol {
  1165. if !MoneyReg.MatchString(td1.Val) {
  1166. td1.BH = true
  1167. td1.KeyDirect = 2
  1168. td1.KVDirect = 1
  1169. }
  1170. }
  1171. }
  1172. }
  1173. } else {
  1174. for _, tr1 := range table.TRs[1:] {
  1175. for _, td1 := range tr1.TDs[1:] {
  1176. if td1.StartCol == td.StartCol && !td1.MustBH {
  1177. td1.BH = false
  1178. td1.KeyDirect = 0
  1179. td1.KVDirect = 0
  1180. }
  1181. }
  1182. }
  1183. }
  1184. }
  1185. }
  1186. }
  1187. }
  1188. }
  1189. }
  1190. }
  1191. //qutil.Debug("table.Brule", table.Brule, !bkeyfirstcol && !bkeyfirstrow)
  1192. if !table.Brule || (!bkeyfirstcol && !bkeyfirstrow) {
  1193. //断行问题,虽然同列或同行,但中间被跨行截断,表格方向调整
  1194. for _, k := range table.StartAndEndRationKSort.Keys {
  1195. v := table.StartAndEndRation[k]
  1196. //横向判断,要判断最多的方向,否则会出现不定的情况(map遍历问题)
  1197. k1 := k[:1]
  1198. for _, v2 := range v.Poss {
  1199. lentds := len(v.Tdmap[v2])
  1200. if v.Rationmap[v2] > checkval {
  1201. for _, td := range v.Tdmap[v2] {
  1202. if td.KeyDirect == 0 && !MoneyReg.MatchString(td.Val) {
  1203. if k1 == "r" {
  1204. ck := fmtkey("c", td.StartCol, td.EndCol)
  1205. rt := table.StartAndEndRation[ck]
  1206. //clen := 0
  1207. var fv float32
  1208. var tdn []*TD
  1209. if rt != nil {
  1210. fv, tdn = rt.GetTDRation(td)
  1211. //clen = len(tdn)
  1212. }
  1213. if lentds > 1 {
  1214. if ((tdn != nil && v.Rationmap[v2] > fv) || tdn == nil) && td.Valtype != "BO" {
  1215. td.KeyDirect = 1
  1216. td.KVDirect = 2
  1217. td.BH = true
  1218. }
  1219. }
  1220. } else {
  1221. ck := fmtkey("r", td.StartRow, td.EndRow)
  1222. rt := table.StartAndEndRation[ck]
  1223. var fv float32
  1224. var tdn []*TD
  1225. //clen := 0
  1226. if rt != nil {
  1227. fv, tdn = rt.GetTDRation(td)
  1228. //clen = len(tdn)
  1229. }
  1230. if lentds > 1 {
  1231. if ((tdn != nil && v.Rationmap[v2] > fv) || tdn == nil) && td.Valtype != "BO" {
  1232. td.KeyDirect = 2
  1233. td.KVDirect = 1
  1234. td.BH = true
  1235. }
  1236. }
  1237. }
  1238. } else {
  1239. break
  1240. }
  1241. }
  1242. } else if v.Rationmap[v2] < 0.5 && len(v.Tdmap[v2]) > 3 {
  1243. for _, td := range v.Tdmap[v2] {
  1244. // u.Debug(td.Val, "-----", td.BH)
  1245. if td.KeyDirect == 0 && td.BH && !td.MustBH {
  1246. if k1 == "r" {
  1247. ck := fmtkey("c", td.StartCol, td.EndCol)
  1248. rt := table.StartAndEndRation[ck]
  1249. clen := 0
  1250. var fv float32
  1251. var tdn []*TD
  1252. if rt != nil {
  1253. fv, tdn = rt.GetTDRation(td)
  1254. clen = len(tdn)
  1255. }
  1256. if lentds >= clen && lentds > 1 {
  1257. if (tdn != nil && v.Rationmap[v2] < fv) || tdn == nil {
  1258. td.BH = false
  1259. }
  1260. }
  1261. } else {
  1262. ck := fmtkey("r", td.StartRow, td.EndRow)
  1263. rt := table.StartAndEndRation[ck]
  1264. var fv float32
  1265. var tdn []*TD
  1266. clen := 0
  1267. if rt != nil {
  1268. fv, tdn = rt.GetTDRation(td)
  1269. clen = len(tdn)
  1270. }
  1271. if lentds >= clen && lentds > 1 {
  1272. if (tdn != nil && v.Rationmap[v2] < fv) || tdn == nil {
  1273. td.BH = false
  1274. }
  1275. }
  1276. }
  1277. } else {
  1278. break
  1279. }
  1280. }
  1281. }
  1282. }
  1283. }
  1284. }
  1285. table.GetKeyRation()
  1286. if len(table.TRs) > 0 && len(table.TRs[0].TDs) > 0 {
  1287. t0 := table.TRs[0].TDs[0]
  1288. key := fmtkey("r", t0.StartRow, t0.EndRow)
  1289. r, t := table.StartAndEndRation[key].GetTDRation(t0)
  1290. if r > 0.9 && len(t) > 1 {
  1291. table.BFirstRow = true
  1292. }
  1293. for k, tr := range table.TRs {
  1294. if len(tr.TDs) == 1 && tr.TDs[0].StartCol == 0 && tr.TDs[0].EndCol+1 == table.ColNum {
  1295. tr.TDs[0].BH = false
  1296. tr.TDs[0].KVDirect = 0
  1297. sv := FindKv(tr.TDs[0].Val, "", 2)
  1298. _, resm := colonkvEntity.entrance(tr.TDs[0].Val, "", 2)
  1299. for k, v := range resm {
  1300. sv.AddKey(k, v)
  1301. }
  1302. if len(sv.Keys) > 0 {
  1303. for k1, v1 := range sv.Map {
  1304. if tr.TDs[0].SortKV.Map[k1] == nil {
  1305. table.SortKV.AddKey(k1, v1)
  1306. }
  1307. }
  1308. } else if table.Tag == "" && k == 0 && len(tr.TDs[0].Val) > 11 {
  1309. table.Tag = tr.TDs[0].Val
  1310. }
  1311. // subVal := tdval_reg.FindAllStringSubmatch(tr.TDs[0].Val, -1)
  1312. // //u.Debug(tr.TDs[0].Val, subVal)
  1313. // if len(subVal) > 0 {
  1314. // for _, subv1 := range subVal {
  1315. // if len(subv1) == 3 {
  1316. // table.SortKV.AddKey(subv1[1], subv1[2])
  1317. // }
  1318. // }
  1319. // } else if k == 0 && len(tr.TDs[0].Val) > 11 {
  1320. // table.Tag = tr.TDs[0].Val
  1321. // }
  1322. }
  1323. // for _, td := range tr.TDs {
  1324. // u.Debug(td.BH, td.Val, "----")
  1325. // }
  1326. }
  1327. }
  1328. }
  1329. //查找表格的kv,调用FindTdVal
  1330. func (table *Table) FindKV() {
  1331. //判断全是key的表格不再查找
  1332. if table.BHeader { //只要一个是key即为true
  1333. direct := If(table.BFirstRow, 2, 1).(int) //kv,2查找方向,向上查找
  1334. vdirect := If(direct == 2, 1, 2).(int)
  1335. //控制跨行表格
  1336. bcon := false
  1337. //增加表格切块判断,只判断切块分包
  1338. //控制中标人排序方向
  1339. bodirect := 0
  1340. //控制中标人排序数值
  1341. sort := 1
  1342. //开始抽取
  1343. for _, tr := range table.TRs {
  1344. if len(tr.TDs) == 1 {
  1345. bcon = false
  1346. td := tr.TDs[0]
  1347. if td.StartCol == 0 && td.EndCol+1 == table.ColNum && len([]rune(td.Val)) > 4 && len([]rune(td.Val)) < 50 {
  1348. res, _, _, _, _ := CheckCommon(td.Val, "abandontable")
  1349. if res { //以下内容丢弃
  1350. bcon = true
  1351. }
  1352. }
  1353. }
  1354. if bcon {
  1355. continue
  1356. }
  1357. if tr.TDs[0].StartRow > 0 {
  1358. numbh := 0
  1359. for _, td := range tr.TDs {
  1360. if td.BH {
  1361. numbh++
  1362. }
  1363. }
  1364. if numbh > 0 && numbh <= len(tr.TDs)/2 {
  1365. direct, vdirect = 1, 2
  1366. } else {
  1367. direct, vdirect = 2, 1
  1368. }
  1369. }
  1370. for _, td := range tr.TDs {
  1371. /**
  1372. rt := table.StartAndEndRation[fmtkey("r", td.StartCol, td.EndCol)]
  1373. if rt != nil {
  1374. r, t := rt.GetTDRation(td)
  1375. u.Debug(td.BH, td.Val, r, t)
  1376. }
  1377. **/
  1378. // if td.Val == "电视" || td.Val == "电话机" || td.Val == "传真机" || td.Val == "音响" {
  1379. //qutil.Debug("----td.Valtype", td.Valtype, "td.BH:", td.BH, "KVDirect:", td.KVDirect, "Val:", td.Val, "direct:", direct, "vdirect:", vdirect)
  1380. // }
  1381. if !td.BH && td.KVDirect < 3 {
  1382. if !table.FindTdVal(td, direct, vdirect) {
  1383. if !table.FindTdVal(td, vdirect, direct) {
  1384. //都识别不到时,对第一、二中标候选人的处理
  1385. bo, res := GetBidOrder(td, bodirect, sort)
  1386. if res {
  1387. sort++
  1388. bodirect = bo
  1389. }
  1390. }
  1391. }
  1392. //fmt.Println("td:", td.Val, td.BH, td.HeadTd, td.KVDirect)
  1393. }
  1394. }
  1395. }
  1396. //qutil.Debug("FindKV", table.SortKV.Map)
  1397. } else if len(table.TRs) > 0 { //没有表头的表格处理,默认纵向吧
  1398. res := make([][]string, len(table.TRs[0].TDs))
  1399. for n, _ := range res {
  1400. res[n] = []string{}
  1401. }
  1402. for _, tr := range table.TRs {
  1403. for n, td := range table.TRs[0].TDs { //第一行的所有td
  1404. td1 := table.GetTdByRCNo(tr.TDs[0].StartRow, td.StartCol)
  1405. if td1 != nil {
  1406. res[n] = append(res[n], td1.Val)
  1407. } else {
  1408. res[n] = append(res[n], "")
  1409. }
  1410. }
  1411. }
  1412. //再拆值,类似http://www.ggzy.hi.gov.cn/cgzbgg/16553.jhtml第二列,有多个值
  1413. nmapkeys := []int{}
  1414. nmap := map[int][]*u.Kv{}
  1415. L:
  1416. for _, r1 := range res {
  1417. for n, r := range r1 {
  1418. if len([]rune(r)) < 60 { // 长度小于60才去分
  1419. //res1, _ := GetKVAll(r, "", nil)
  1420. res1, _ := colonkvEntity.entrance(r, "", 2)
  1421. if res1 != nil {
  1422. nmap[n] = res1
  1423. nmapkeys = append(nmapkeys, n)
  1424. /**
  1425. //截取串
  1426. for _k1, _ := range res1 {
  1427. r = regexp.MustCompile(_k1+".*").ReplaceAllString(r, "")
  1428. }
  1429. r1[n] = r
  1430. res[pos] = r1
  1431. **/
  1432. } else if nmap[n] != nil {
  1433. //放空值
  1434. nmap[n] = append(nmap[n], &u.Kv{})
  1435. }
  1436. } else {
  1437. nmap = nil
  1438. nmapkeys = nil
  1439. break L
  1440. }
  1441. }
  1442. }
  1443. //调整
  1444. if len(nmap) > 0 {
  1445. kmapkeys := []string{}
  1446. kmap := map[string][]string{}
  1447. for _, mk := range nmapkeys { //同是第n列
  1448. for pos, m1 := range nmap[mk] {
  1449. k, v := m1.Key, m1.Value
  1450. kv := kmap[k]
  1451. if kv == nil {
  1452. kv = []string{}
  1453. }
  1454. kv = append(kv, v)
  1455. kmap[k] = kv
  1456. kmapkeys = append(kmapkeys, k)
  1457. for _, k := range kmapkeys {
  1458. arr := kmap[k]
  1459. if len(arr) < pos {
  1460. arr = append(arr, "")
  1461. kmap[k] = arr
  1462. kmapkeys = append(kmapkeys, k)
  1463. }
  1464. }
  1465. }
  1466. }
  1467. if len(kmap) > 0 {
  1468. for _, k := range kmapkeys {
  1469. table.SortKV.AddKey(k, kmap[k])
  1470. }
  1471. }
  1472. }
  1473. //=================
  1474. //解析值放到map中
  1475. for _, arr := range res {
  1476. if len(arr) > 0 {
  1477. v1 := arr[0]
  1478. _, _, _, _, repl := CheckCommon(v1, "con")
  1479. if repl == "ENT" {
  1480. table.SortKV.AddKey("中标单位", arr)
  1481. continue
  1482. } else if repl == "BO" {
  1483. table.SortKV.AddKey("排名", arr)
  1484. continue
  1485. }
  1486. }
  1487. }
  1488. }
  1489. //qutil.Debug("FindKV", table.SortKV.Map)
  1490. }
  1491. //获取中标人顺序
  1492. //direct 0默认 1横向 2纵向
  1493. func GetBidOrder(td *TD, direct, n int) (d int, res bool) {
  1494. if td.Valtype != "BO" {
  1495. return
  1496. }
  1497. if td.Rowspan > 1 {
  1498. for i := 0; i < td.Rowspan; i++ {
  1499. nextcol := 1
  1500. L1:
  1501. for {
  1502. vtd := td.TR.Table.GetTdByRCNo(td.StartRow+i, td.EndCol+nextcol)
  1503. if vtd == nil {
  1504. break L1
  1505. }
  1506. nextcol += vtd.Colspan
  1507. if filter_zbdw_v2.MatchString(vtd.Val) {
  1508. arrbo := td.TR.Table.SortKV.Map[NullTxtBid]
  1509. if arrbo == nil {
  1510. arrbo = []map[string]interface{}{}
  1511. td.TR.Table.SortKV.AddKey(NullTxtBid, arrbo)
  1512. }
  1513. a1 := arrbo.([]map[string]interface{})
  1514. a1 = append(a1, map[string]interface{}{
  1515. "entname": vtd.Val,
  1516. "sortstr": td.Val,
  1517. "sort": GetBidSort(td.Val, n),
  1518. })
  1519. res = true
  1520. td.TR.Table.SortKV.Map[NullTxtBid] = a1
  1521. }
  1522. }
  1523. }
  1524. } else if td.Colspan > 1 {
  1525. for i := 1; i < td.Colspan; i++ {
  1526. nextcol := 0
  1527. L2:
  1528. for {
  1529. vtd := td.TR.Table.GetTdByRCNo(td.StartRow+i, td.StartCol+nextcol)
  1530. if vtd == nil || vtd.Colspan >= td.Colspan {
  1531. break L2
  1532. }
  1533. nextcol += vtd.Colspan
  1534. if filter_zbdw_v2.MatchString(vtd.Val) {
  1535. arrbo := td.TR.Table.SortKV.Map[NullTxtBid]
  1536. if arrbo == nil {
  1537. arrbo = []map[string]interface{}{}
  1538. td.TR.Table.SortKV.AddKey(NullTxtBid, arrbo)
  1539. }
  1540. a1 := arrbo.([]map[string]interface{})
  1541. a1 = append(a1, map[string]interface{}{
  1542. "entname": vtd.Val,
  1543. "sortstr": td.Val,
  1544. "sort": GetBidSort(td.Val, n),
  1545. })
  1546. res = true
  1547. td.TR.Table.SortKV.Map[NullTxtBid] = a1
  1548. }
  1549. }
  1550. }
  1551. } else {
  1552. rtd := td.TR.Table.GetTdByRCNo(td.StartRow, td.EndCol+1)
  1553. btd := td.TR.Table.GetTdByRCNo(td.EndRow+1, td.StartCol)
  1554. //if ((rtd != nil && !rtd.BH && rtd.Valtype == "BO") || direct == 1) && btd != nil && filter_zbdw_v.MatchString(btd.Val) {
  1555. if ((rtd != nil && !rtd.BH) || direct == 1) && btd != nil && filter_zbdw_v2.MatchString(btd.Val) {
  1556. d = 1
  1557. arrbo := td.TR.Table.SortKV.Map[NullTxtBid]
  1558. if arrbo == nil {
  1559. arrbo = []map[string]interface{}{}
  1560. td.TR.Table.SortKV.AddKey(NullTxtBid, arrbo)
  1561. }
  1562. a1 := arrbo.([]map[string]interface{})
  1563. a1 = append(a1, map[string]interface{}{
  1564. "entname": btd.Val,
  1565. "sortstr": td.Val,
  1566. "sort": GetBidSort(td.Val, n),
  1567. })
  1568. res = true
  1569. td.TR.Table.SortKV.Map[NullTxtBid] = a1
  1570. //} else if ((btd != nil && !btd.BH && btd.Valtype == "BO") || direct == 2) && rtd != nil && filter_zbdw_v.MatchString(rtd.Val) {
  1571. } else if ((btd != nil && !btd.BH) || direct == 2) && rtd != nil && filter_zbdw_v2.MatchString(rtd.Val) {
  1572. d = 2
  1573. arrbo := td.TR.Table.SortKV.Map[NullTxtBid]
  1574. if arrbo == nil {
  1575. arrbo = []map[string]interface{}{}
  1576. td.TR.Table.SortKV.AddKey(NullTxtBid, arrbo)
  1577. }
  1578. a1 := arrbo.([]map[string]interface{})
  1579. a1 = append(a1, map[string]interface{}{
  1580. "entname": rtd.Val,
  1581. "sortstr": td.Val,
  1582. "sort": GetBidSort(td.Val, n),
  1583. })
  1584. res = true
  1585. td.TR.Table.SortKV.Map[NullTxtBid] = a1
  1586. }
  1587. }
  1588. return
  1589. }
  1590. func GetBidSort(str string, n int) int {
  1591. val := n
  1592. if strings.Index(str, "首选") > -1 {
  1593. val = 1
  1594. } else {
  1595. val = winnerOrderEntity.toNumber(str, n)
  1596. }
  1597. return val
  1598. }
  1599. //查找每一个单元格的表头,调用FindNear
  1600. func (table *Table) FindTdVal(td *TD, direct, vdirect int) (b bool) {
  1601. near := table.FindNear(td, direct)
  1602. // if near != nil {
  1603. // fmt.Println("near----", near.Val, td.Val)
  1604. // }
  1605. // qutil.Debug(near != nil)
  1606. // qutil.Debug(near.BH)
  1607. // qutil.Debug(near.KeyDirect == vdirect, near.KeyDirect == 0)
  1608. // qutil.Debug(near.KVDirect == direct, near.KVDirect == 0)
  1609. // qutil.Debug(near.KVDirect < 3)
  1610. if near != nil && near.BH && (near.KeyDirect == vdirect || near.KeyDirect == 0) && (near.KVDirect == direct || near.KVDirect == 0) && near.KVDirect < 3 {
  1611. near.KVDirect = direct
  1612. near.KeyDirect = vdirect
  1613. td.KVDirect = direct
  1614. key := near.Val
  1615. if near.Val == "" {
  1616. key = fmtkey("k", near.TR.RowPos, near.ColPos)
  1617. }
  1618. val := table.SortKV.Map[key]
  1619. //qutil.Debug("====================", "key:", key, "val:", val)
  1620. bthiskey := false
  1621. if val != nil {
  1622. curpos := table.SortKV.Index[key]
  1623. thistr := table.kTD[curpos]
  1624. if thistr != near {
  1625. near.Val += "_"
  1626. for table.SortKV.Map[near.Val] != nil {
  1627. near.Val += "_"
  1628. }
  1629. key = near.Val //之前这个地方没有重置,导致把之前结果覆盖了
  1630. } else {
  1631. bthiskey = true
  1632. }
  1633. }
  1634. bfind := false
  1635. barr := false
  1636. varrpos := -1
  1637. if bthiskey {
  1638. //处理是数组值,且有合并行或合并列的情况 kvscope,对数组值的处理
  1639. pos := table.SortKV.Index[key]
  1640. mval := table.kvscope[pos]
  1641. bvalfind := false
  1642. if direct == 1 { //kv是横向
  1643. L1:
  1644. for k3, v3 := range mval {
  1645. for _, v4 := range v3 {
  1646. if v4.EndRow+1 == td.StartRow && v4.EndCol == td.EndCol {
  1647. varrpos = k3
  1648. bvalfind = true
  1649. break L1
  1650. }
  1651. }
  1652. }
  1653. } else { //kv是纵向
  1654. L2:
  1655. for k3, v3 := range mval {
  1656. for _, v4 := range v3 {
  1657. if v4.EndCol+1 == td.StartCol && v4.EndRow == td.EndRow {
  1658. varrpos = k3
  1659. bvalfind = true
  1660. break L2
  1661. }
  1662. }
  1663. }
  1664. }
  1665. if vals, ok := val.([]string); ok {
  1666. if near.Val == "" {
  1667. bn := false
  1668. for _, vs := range vals {
  1669. if vs != "" && NullTdReg.MatchString(vs) {
  1670. bn = true
  1671. } else {
  1672. bn = false
  1673. break
  1674. }
  1675. }
  1676. if bn {
  1677. near.Val = NullTxtBid
  1678. key = NullTxtBid
  1679. bfind = true
  1680. }
  1681. }
  1682. if bvalfind {
  1683. vals[varrpos] = td.Val // += "__" + td.Val
  1684. } else {
  1685. vals = append(vals, td.Val)
  1686. val = vals
  1687. varrpos = len(vals) - 1
  1688. }
  1689. } else if vals, ok := val.(string); ok {
  1690. if bvalfind {
  1691. val = td.Val //vals + "__" + td.Val
  1692. } else {
  1693. tval := []string{vals}
  1694. tval = append(tval, td.Val)
  1695. val = tval
  1696. varrpos = 1
  1697. }
  1698. }
  1699. barr = true
  1700. } else {
  1701. val = td.Val
  1702. }
  1703. td.HeadTd = near
  1704. if bfind {
  1705. tkey := fmtkey("k", near.TR.RowPos, near.ColPos)
  1706. table.SortKV.ReplaceKey(key, val, tkey)
  1707. } else {
  1708. table.SortKV.AddKey(key, val)
  1709. //if table.SortKV.Map[key] != nil {
  1710. pos := table.SortKV.Index[key]
  1711. //qutil.Debug("=========", "key:", key, "val:", val, "pos:", pos)
  1712. if barr {
  1713. mval := table.kvscope[pos]
  1714. if mval != nil {
  1715. tds := mval[varrpos]
  1716. if tds != nil {
  1717. tds = append(tds, td)
  1718. } else {
  1719. tds = []*TD{td}
  1720. }
  1721. if varrpos > -1 {
  1722. mval[varrpos] = tds
  1723. table.kvscope[pos] = mval
  1724. }
  1725. }
  1726. } else {
  1727. table.kvscope[pos] = map[int][]*TD{
  1728. 0: []*TD{td},
  1729. }
  1730. table.kTD[pos] = near
  1731. }
  1732. //}
  1733. }
  1734. b = true
  1735. }
  1736. return
  1737. }
  1738. //查找单元格的表头时,横向或纵向
  1739. func (table *Table) FindNear(td *TD, direct int) *TD {
  1740. if direct == 1 && td.StartCol > 0 { //左临
  1741. tr := table.TRs[:td.TR.RowPos+1]
  1742. for i := len(tr) - 1; i > -1; i-- {
  1743. tds := tr[i].TDs
  1744. for _, td1 := range tds {
  1745. if td1.StartRow <= td.StartRow && td1.EndRow >= td.EndRow && td1.EndCol+1 == td.StartCol {
  1746. //找到左临节点
  1747. if td1.BH {
  1748. return td1
  1749. } else {
  1750. if td1.HeadTd != nil && td1.HeadTd.KVDirect == direct {
  1751. return td1.HeadTd
  1752. }
  1753. }
  1754. }
  1755. }
  1756. }
  1757. } else if direct == 2 && td.StartRow > 0 { //上临
  1758. tr := table.TRs[:td.TR.RowPos]
  1759. for i := len(tr) - 1; i > -1; i-- {
  1760. tds := tr[i].TDs
  1761. for _, td1 := range tds {
  1762. if td1.StartCol <= td.StartCol && td1.EndCol >= td.EndCol && td1.EndRow+1 == td.StartRow {
  1763. //找到左临节点
  1764. if td1.BH {
  1765. return td1
  1766. } else {
  1767. if td1.HeadTd != nil && td1.HeadTd.KVDirect == direct {
  1768. return td1.HeadTd
  1769. }
  1770. }
  1771. }
  1772. }
  1773. }
  1774. }
  1775. return nil
  1776. }
  1777. //根据行号列号获取td对象
  1778. func (tn *Table) GetTdByRCNo(row, col int) *TD {
  1779. for _, tr := range tn.TRs {
  1780. for _, td := range tr.TDs {
  1781. if td.StartCol <= col && td.EndCol >= col && td.StartRow <= row && td.EndRow >= row {
  1782. return td
  1783. }
  1784. }
  1785. }
  1786. return nil
  1787. }
  1788. //判断表格是否是分包
  1789. func (tn *Table) CheckMultiPackageByTable() (b bool, index []string) {
  1790. pac := 0
  1791. val := 0
  1792. index = []string{}
  1793. index_pos := []int{}
  1794. //是数组且能找到标段之类的提示
  1795. arr_count := 0
  1796. key_index := -1
  1797. hasPkgTd := map[string]bool{}
  1798. for in, k := range tn.SortKV.Keys {
  1799. if excludeKey.MatchString(BracketsTextReg.ReplaceAllString(k, "")) {
  1800. continue
  1801. }
  1802. v := tn.SortKV.Map[k]
  1803. vs, bvs := v.([]string)
  1804. if bvs {
  1805. arr_count++
  1806. haspkgs := []string{}
  1807. for in2, v1 := range vs {
  1808. v1 = replPkgConfusion(v1)
  1809. if len([]rune(v1)) < 8 && !moneyNum.MatchString(v1) && FindVal_1.MatchString(v1) {
  1810. if key_index == -1 {
  1811. key_index = in
  1812. } else if key_index != in {
  1813. break
  1814. }
  1815. index = append(index, FindVal_1.FindString(v1))
  1816. index_pos = append(index_pos, in2)
  1817. val += 1
  1818. pac++
  1819. } else {
  1820. if ok, v1new := isHasOnePkgAndNoKv(v1); ok {
  1821. haspkgs = append(haspkgs, v1new)
  1822. }
  1823. }
  1824. }
  1825. /*处理这种情况:
  1826. <tr><td>包一:xxxxxxxxx</td></tr>
  1827. <tr><td>包二:xxxxxxxxx</td></tr>
  1828. */
  1829. if len(index) == 0 && len(haspkgs) > 0 && len(haspkgs) == len(vs) {
  1830. for in2, v1 := range haspkgs {
  1831. if key_index == -1 {
  1832. key_index = in
  1833. } else if key_index != in {
  1834. break
  1835. }
  1836. index = append(index, v1)
  1837. index_pos = append(index_pos, in2)
  1838. val += 1
  1839. pac++
  1840. }
  1841. }
  1842. } else if v1, ok := v.(string); ok {
  1843. v1 = replPkgConfusion(v1)
  1844. if len([]rune(v1)) < 8 && !moneyNum.MatchString(v1) && FindVal_1.MatchString(v1) {
  1845. key_index = in
  1846. index = append(index, FindVal_1.FindString(v1))
  1847. index_pos = append(index_pos, 0)
  1848. val += 1
  1849. pac++
  1850. } else if getTd := tn.GetTdByRCNo(0, tn.SortKV.Index[k]); getTd != nil && getTd.KVDirect == 2 {
  1851. /*处理这种情况:
  1852. <tr><td>包一:xxxxxxxxx</td></tr>
  1853. */
  1854. if ok, v1new := isHasOnePkgAndNoKv(v1); ok {
  1855. hasPkgTd[k] = true
  1856. key_index = in
  1857. index = append(index, v1new)
  1858. index_pos = append(index_pos, 0)
  1859. val += 1
  1860. pac++
  1861. }
  1862. }
  1863. }
  1864. }
  1865. //key是分包的情况
  1866. //记录key对应的值
  1867. commonKeyVals := map[string][]string{}
  1868. //记录key出现的次数
  1869. keyExistsCount := map[string]int{}
  1870. if pac > 1 {
  1871. val = 10
  1872. } else {
  1873. //查找标签
  1874. if TableMultiPackageReg_4.MatchString(tn.Tag) {
  1875. val += 4
  1876. } else if TableMultiPackageReg_2.MatchString(tn.Tag) {
  1877. val += 4
  1878. }
  1879. keyIsPkg := false
  1880. for in, k := range tn.SortKV.Keys {
  1881. if excludeKey.MatchString(BracketsTextReg.ReplaceAllString(k, "")) {
  1882. continue
  1883. }
  1884. v := tn.SortKV.Map[k]
  1885. //key是分包的情况
  1886. if ismatch := FindVal_1.MatchString(k); keyIsPkg || ismatch {
  1887. if ismatch {
  1888. keyIsPkg = true
  1889. val += 4
  1890. pkgFlag := FindVal_1.FindString(k)
  1891. k = strings.Replace(k, pkgFlag, "", -1)
  1892. index = append(index, pkgFlag)
  1893. index_pos = append(index_pos, len(index))
  1894. val += 1
  1895. pac++
  1896. } else {
  1897. k = strings.TrimRight(k, "_")
  1898. }
  1899. keyExistsCount[k] = keyExistsCount[k] + 1
  1900. commonKeyVals[k] = append(commonKeyVals[k], qutil.ObjToString(v))
  1901. } else if k1 := FilterKey_2.ReplaceAllString(k, ""); FindKey_2.MatchString(k1) {
  1902. val += 4
  1903. if vs, bvs1 := v.([]string); bvs1 {
  1904. L:
  1905. for in2, v1 := range vs {
  1906. if len([]rune(v1)) < 20 && !moneyNum.MatchString(v1) && FindVal2_1.MatchString(v1) {
  1907. for _, serial := range regSerialTitles_2 {
  1908. if serial.MatchString(v1) {
  1909. break L
  1910. }
  1911. }
  1912. if key_index == -1 {
  1913. key_index = in
  1914. } else if key_index != in {
  1915. break
  1916. }
  1917. index = append(index, v1)
  1918. index_pos = append(index_pos, in2)
  1919. val += 1
  1920. pac++
  1921. }
  1922. }
  1923. } else if v1, ok := v.(string); ok && !hasPkgTd[k] {
  1924. v1 = replPkgConfusion(v1)
  1925. for _, v2 := range strings.Split(v1, "/") {
  1926. if len([]rune(v2)) < 20 && !moneyNum.MatchString(v2) && FindVal2_1.MatchString(v2) {
  1927. key_index = in
  1928. index = append(index, v1)
  1929. index_pos = append(index_pos, 0)
  1930. val += 1
  1931. pac++
  1932. underline := ""
  1933. for {
  1934. underline += "_"
  1935. if tn.SortKV.Map[k+underline] == nil {
  1936. break
  1937. } else if v3, v2_ok := tn.SortKV.Map[k+underline].(string); v2_ok && v3 != "" {
  1938. index = append(index, v3)
  1939. index_pos = append(index_pos, 1)
  1940. } else if v3, v2_ok := tn.SortKV.Map[k+underline].([]string); v2_ok {
  1941. for v2_k, v2_v := range v3 {
  1942. index = append(index, v2_v)
  1943. index_pos = append(index_pos, v2_k+1)
  1944. }
  1945. }
  1946. }
  1947. break
  1948. }
  1949. }
  1950. }
  1951. break
  1952. }
  1953. }
  1954. }
  1955. // u.Debug(index)
  1956. //过滤重复及标准化!
  1957. standIndex := []string{}
  1958. standIndex_pos := []int{}
  1959. oldIndex := []string{}
  1960. brepeat := map[string]bool{}
  1961. for k, v := range index {
  1962. v = u.PackageNumberConvert(v)
  1963. if !brepeat[v] {
  1964. brepeat[v] = true
  1965. standIndex = append(standIndex, v)
  1966. standIndex_pos = append(standIndex_pos, index_pos[k])
  1967. oldIndex = append(oldIndex, v)
  1968. }
  1969. }
  1970. index = standIndex
  1971. //有一个以上的包,并且相同的key出现一次以上,认为这个key是属于包里面的
  1972. if len(commonKeyVals) > 0 {
  1973. for k, v := range commonKeyVals {
  1974. if len(index) > 1 && keyExistsCount[k] < 2 {
  1975. continue
  1976. }
  1977. tn.SortKV.AddKey(k, v)
  1978. }
  1979. }
  1980. //
  1981. isGoonNext := false
  1982. if val > 4 && len(brepeat) > 0 {
  1983. b = true
  1984. //多包解析
  1985. if b {
  1986. tn.BPackage = true
  1987. for nk, v := range index {
  1988. if tn.BlockPackage.Map[v] == nil {
  1989. bp := &u.BlockPackage{}
  1990. bp.Index = v
  1991. bp.Origin = oldIndex[nk]
  1992. bp.TableKV = u.NewJobKv()
  1993. tn.BlockPackage.AddKey(v, bp)
  1994. }
  1995. }
  1996. if len(index) == 1 { //是一个的情况
  1997. if len(tn.SortKV.Keys) < 10 && tn.ColNum < 10 && tn.RowNum < 4 {
  1998. beq := true
  1999. for _, v2 := range tn.SortKV.Map {
  2000. if _, ok := v2.(string); !ok {
  2001. beq = false
  2002. break
  2003. }
  2004. }
  2005. if beq { //统一处理为数组
  2006. td := tn.GetTdByRCNo(tn.RowNum-1, 0)
  2007. if !td.BH && FindVal2_1.MatchString(td.Val) {
  2008. for k2, v2 := range tn.SortKV.Map {
  2009. tn.SortKV.Map[k2] = []string{v2.(string)}
  2010. }
  2011. } else {
  2012. //没有处理成数组的情况下,继续调用正文查找分包的方法
  2013. isGoonNext = true
  2014. }
  2015. }
  2016. }
  2017. }
  2018. for _, k1 := range tn.SortKV.Keys {
  2019. v1 := tn.SortKV.Map[k1]
  2020. if _, bvs := v1.(string); bvs && len(index) > 1 && !strings.HasSuffix(k1, "_") {
  2021. v1_array := []string{v1.(string)}
  2022. underline := ""
  2023. for {
  2024. underline += "_"
  2025. if tn.SortKV.Map[k1+underline] == nil {
  2026. break
  2027. } else if v3, v2_ok := tn.SortKV.Map[k1+underline].(string); v2_ok && v3 != "" {
  2028. v1_array = append(v1_array, v3)
  2029. }
  2030. }
  2031. v1 = v1_array
  2032. }
  2033. if val, bvs := v1.([]string); bvs {
  2034. if len(val) <= len(index) {
  2035. for k, v := range val {
  2036. tn.assemblePackage(k1, v, index[k])
  2037. }
  2038. } else {
  2039. for sk1, sv2 := range index {
  2040. v := val[sk1]
  2041. //处理http://www.hljcg.gov.cn/xwzs!queryOneXwxxqx.action?xwbh=8145b599-a11e-45cb-a76a-12157a715570
  2042. if v == "" && strings.Index(k1, "供应商") > -1 {
  2043. if sk1 != len(index)-1 {
  2044. //u.Debug(val[sk1+1], val[sk1+2])
  2045. if standIndex_pos[sk1+1]-standIndex_pos[sk1] > 1 {
  2046. v = val[standIndex_pos[sk1]+1]
  2047. }
  2048. } else {
  2049. if standIndex_pos[sk1] < len(val)-1 {
  2050. v = val[standIndex_pos[sk1]+1]
  2051. }
  2052. }
  2053. }
  2054. tn.assemblePackage(k1, v, sv2)
  2055. }
  2056. }
  2057. //删除子包的kv
  2058. //u.Debug("----==1==-------", k1)
  2059. k1tags := u.GetTags(k1)
  2060. //if !(len(k1tags) > 0 && k1tags[0].Value == "采购单位") {
  2061. // tn.SortKV.RemoveKey(k1)
  2062. //}
  2063. for _, vcgdw := range k1tags {
  2064. if vcgdw.Value == "采购单位" {
  2065. tn.SortKV.RemoveKey(k1)
  2066. }
  2067. }
  2068. } else if val, bvs := v1.(string); bvs && len(index) == 1 {
  2069. //删除子包的kv
  2070. k1tags, _, _, _, _ := CommonDataAnaly(k1, "", "", val)
  2071. if !(len(k1tags) > 0 && regexp.MustCompile("^(项目|开标|采购单位|招标机构)").MatchString(k1tags[0])) { //(k1tags[0].Value == "采购单位" || k1tags[0].Value == "项目编号")) {
  2072. //log.Println("remove", k1, val)
  2073. tn.assemblePackage(k1, val, index[0])
  2074. tn.SortKV.RemoveKey(k1)
  2075. }
  2076. //u.Debug("----==2==-------", k1)
  2077. }
  2078. }
  2079. }
  2080. } else {
  2081. isGoonNext = true
  2082. }
  2083. if isGoonNext {
  2084. blockPackage := map[string]*u.BlockPackage{}
  2085. for _, k := range tn.SortKV.Keys {
  2086. if excludeKey.MatchString(k) {
  2087. continue
  2088. }
  2089. str := ""
  2090. v := tn.SortKV.Map[k]
  2091. nk := regReplAllSpace.ReplaceAllString(k, "")
  2092. if vs, ok := v.([]string); ok {
  2093. str += fmt.Sprintf("%s:%s\n", nk, strings.Join(vs, " "))
  2094. } else {
  2095. str += fmt.Sprintf("%s:%s\n", nk, v)
  2096. }
  2097. b, _ := divisionPackageChild(&blockPackage, str, tn.Tag, false, false)
  2098. if b && len(blockPackage) > 0 {
  2099. tn.BPackage = true
  2100. for mk, mv := range blockPackage {
  2101. if tn.BlockPackage.Map[mk] == nil {
  2102. tn.BlockPackage.AddKey(mk, mv)
  2103. } else {
  2104. bp := tn.BlockPackage.Map[mk].(*u.BlockPackage)
  2105. if bp.TableKV == nil {
  2106. bp.TableKV = u.NewJobKv()
  2107. }
  2108. for k2, v2 := range mv.ColonKV.Kv {
  2109. if bp.TableKV.Kv[k2] == "" {
  2110. bp.TableKV.Kv[k2] = v2
  2111. bp.TableKV.KvTag[k2] = mv.ColonKV.KvTag[k2]
  2112. bp.Text += fmt.Sprintf("%v:%v\n", k2, v2)
  2113. }
  2114. }
  2115. for k2, v2 := range mv.SpaceKV.Kv {
  2116. if bp.TableKV.Kv[k2] == "" {
  2117. bp.TableKV.Kv[k2] = v2
  2118. bp.TableKV.KvTag[k2] = mv.SpaceKV.KvTag[k2]
  2119. bp.Text += fmt.Sprintf("%v:%v\n", k2, v2)
  2120. }
  2121. }
  2122. }
  2123. }
  2124. tn.BPackage = true
  2125. tn.SortKV.RemoveKey(k)
  2126. }
  2127. }
  2128. }
  2129. //查找分包中的中标人排序
  2130. if tn.BlockPackage != nil && tn.BlockPackage.Map != nil && len(tn.BlockPackage.Map) > 0 {
  2131. for _, v := range tn.BlockPackage.Map {
  2132. vv := v.(*u.BlockPackage)
  2133. if vv.WinnerOrder == nil || len(vv.WinnerOrder) == 0 {
  2134. vv.WinnerOrder = winnerOrderEntity.Find(vv.Text, true, 2)
  2135. }
  2136. }
  2137. }
  2138. return
  2139. }
  2140. //组装解析到的分包
  2141. func (tn *Table) assemblePackage(k1, v1, key string) {
  2142. bp := tn.BlockPackage.Map[key].(*u.BlockPackage)
  2143. if bp.TableKV == nil {
  2144. bp.TableKV = u.NewJobKv()
  2145. }
  2146. if v1 != "" {
  2147. k2, w1, v2, _, bf := CommonDataAnaly(k1, "中标情况", "", v1)
  2148. if bf {
  2149. for pos, k3 := range k2 {
  2150. if bp.TableKV.Kv != nil && bp.TableKV.KvTag[k3] != nil && (bp.TableKV.Kv[k3] == "" || w1[pos] > bp.TableKV.KvTag[k3].Weight) {
  2151. bp.TableKV.Kv[k3] = v2
  2152. bp.TableKV.KvTag[k3] = &u.Tag{Value: v2, Weight: w1[pos]}
  2153. }
  2154. }
  2155. } else {
  2156. bp.TableKV.Kv[k1] = qutil.ObjToString(v1)
  2157. }
  2158. }
  2159. k1 = regReplAllSpace.ReplaceAllString(k1, "")
  2160. //拼接内容
  2161. if !excludeKey.MatchString(k1) {
  2162. bp.Text += fmt.Sprintf("%v:%v\n", k1, v1)
  2163. }
  2164. tn.BlockPackage.Map[key] = bp
  2165. }
  2166. /**
  2167. 之前爬虫过来的数据对table表格的抓取异常问题
  2168. 查找并修正不规则表格的字符串,只对全文做处理,块内的表格不需要修正
  2169. **/
  2170. var thbf = regexp.MustCompile("(?i)</?t(head|body|foot)>")
  2171. //需要保留thead
  2172. var saveThead = regexp.MustCompile("(?is)<thead>(.+?)</thead>")
  2173. func RepairCon(con string) string {
  2174. res := saveThead.FindAllStringSubmatch(con, 1)
  2175. th := ""
  2176. if len(res) == 1 && len(res[0]) == 2 {
  2177. th = u.TrimLeftSpace(res[0][1], "")
  2178. }
  2179. con = thbf.ReplaceAllString(con, "")
  2180. con = u.TrimLeftSpace(con, "")
  2181. itbody := strings.Index(con, "<tr")
  2182. iLen := 3
  2183. if itbody == 0 {
  2184. con = findpos(con, iLen, itbody)
  2185. } else {
  2186. itable := strings.Index(con, "<table")
  2187. if itable == -1 || itable > itbody {
  2188. con = findpos(con, iLen, itbody)
  2189. }
  2190. }
  2191. //保留第一个thead
  2192. if th != "" {
  2193. con = strings.Replace(con, th, "<thead>"+th+"</thead>", 1)
  2194. }
  2195. //u.Debug(con)
  2196. return con
  2197. }
  2198. //修复表格
  2199. func findpos(con string, iLen, start int) (newcon string) {
  2200. defer qutil.Catch()
  2201. n := len(con)
  2202. layer := 0
  2203. pos := 0
  2204. if start >= 0 {
  2205. if iLen == 6 {
  2206. for i := iLen + start; i < len(con); i++ {
  2207. if con[i] == '<' && i+6 < n {
  2208. str := con[i : i+6]
  2209. if str == "</tbod" {
  2210. if layer == 0 {
  2211. pos = i
  2212. break
  2213. } else {
  2214. layer--
  2215. }
  2216. i += 6
  2217. } else if str == "<tbody" {
  2218. layer++
  2219. i += 6
  2220. }
  2221. }
  2222. }
  2223. if pos+7 <= n && start+6 < pos {
  2224. newcon = con[:start] + "<table" + con[start+6:pos] + "</table" + con[pos+7:]
  2225. }
  2226. } else {
  2227. layer++
  2228. nq := 0
  2229. lasttr := 0
  2230. for i := iLen + start; i < len(con); i++ {
  2231. if con[i] == '<' && i+4 < n {
  2232. if nq == 0 {
  2233. str := con[i : i+4]
  2234. if str == "</tr" {
  2235. if layer <= 0 {
  2236. pos = i //正常情况不会存在此类情况
  2237. break
  2238. } else {
  2239. layer--
  2240. lasttr = i
  2241. }
  2242. i += 4
  2243. } else if str[:3] == "<tr" {
  2244. layer++
  2245. i += 4
  2246. } else if str == "<tab" && i+6 < n && con[i+4:i+6] == "le" {
  2247. if layer == 0 {
  2248. break
  2249. } else {
  2250. //内嵌的表格
  2251. nq++
  2252. }
  2253. }
  2254. } else {
  2255. if i+6 < n {
  2256. str := con[i : i+6]
  2257. if str == "</tabl" {
  2258. nq--
  2259. } else if str == "<table" {
  2260. nq++
  2261. }
  2262. } else {
  2263. break
  2264. }
  2265. }
  2266. }
  2267. }
  2268. if pos == 0 && lasttr > 3 {
  2269. pos = lasttr + 5
  2270. } else if pos > 0 {
  2271. pos += 5
  2272. }
  2273. if pos <= n && pos < len(con) && start < pos {
  2274. newcon = con[:start] + "<table>" + con[start:pos] + "</table>" + con[pos:]
  2275. }
  2276. }
  2277. }
  2278. if newcon == "" {
  2279. newcon = con
  2280. }
  2281. return
  2282. }
  2283. //td的值里面有一个包,并且没有冒号kv
  2284. func isHasOnePkgAndNoKv(v1 string) (bool, string) {
  2285. v1s := FindVal_1.FindAllString(v1, -1)
  2286. colonCount := len(regDivision.FindAllString(v1, -1))
  2287. if len(v1s) == 1 && colonCount < 2 {
  2288. ispkgcolon := regexp.MustCompile(v1s[0] + "[::]").MatchString(v1)
  2289. if (ispkgcolon && colonCount == 1) || (!ispkgcolon && colonCount == 0) {
  2290. return true, v1s[0]
  2291. }
  2292. }
  2293. return false, v1
  2294. }
  2295. //替换分包中混淆的词
  2296. func replPkgConfusion(v1 string) string {
  2297. v1 = PreReg.ReplaceAllString(v1, "")
  2298. v1 = PreReg1.ReplaceAllString(v1, "")
  2299. v1 = PreCon.ReplaceAllString(v1, "")
  2300. v1 = PreCon2.ReplaceAllString(v1, "")
  2301. return v1
  2302. }
  2303. //对td中的值,进行再处理
  2304. func (tn *Table) TdContactFormat(contactFormat *u.ContactFormat) {
  2305. //处理表格中的联系人信息
  2306. indexMap := contactFormat.IndexMap
  2307. matchMap := contactFormat.MatchMap
  2308. weightMap := map[string]map[string]interface{}{} //权重
  2309. mustMatchFirst := len(indexMap) > 0 //第一个必须匹配上
  2310. reCreate := false
  2311. matchCount := 0
  2312. contactTypeTagMap := map[string]map[string][]interface{}{}
  2313. //u.Debug(mustMatchFirst, indexMap, matchMap)
  2314. notMatchTrCount := 0
  2315. allAscFind := true
  2316. if len(indexMap) == 0 {
  2317. isCanAddToIndexMap := false
  2318. matchPrevFlag := false
  2319. prevCanAddToIndexMap := false
  2320. LS:
  2321. for _, tr := range tn.TRs {
  2322. for td_index, td := range tr.TDs {
  2323. thisTdKvs := colonkvEntity.GetKvs(td.Text, "", 2)
  2324. if len(thisTdKvs) == 0 {
  2325. tdValue := regReplAllSpace.ReplaceAllString(td.Text, "")
  2326. if tdValue != "" && len([]rune(tdValue)) < 10 {
  2327. thisTdKvs = append(thisTdKvs, &u.Kv{
  2328. Key: tdValue,
  2329. Value: "",
  2330. })
  2331. }
  2332. }
  2333. if len(thisTdKvs) != 1 {
  2334. continue
  2335. }
  2336. //采购人在联系人、电话后面的处理
  2337. td_k := FilterContactKey(thisTdKvs[0].Key)
  2338. td_k_length := len([]rune(td_k))
  2339. if td_k_length < 2 || td_k_length > 15 {
  2340. continue
  2341. }
  2342. isContinue := ContactInfoMustReg.MatchString(td_k)
  2343. if isContinue || (ContactInfoVagueReg.MatchString(td_k) && u.IsMapHasValue(td_k, ContactType)) {
  2344. if !matchPrevFlag && len(indexMap) > 0 {
  2345. indexMap = map[int]string{}
  2346. break LS
  2347. }
  2348. isCanAddToIndexMap = true
  2349. }
  2350. if isContinue {
  2351. continue
  2352. }
  2353. for _, k := range HasOrderContactType(td_k) {
  2354. if !ContactType[k].MatchString(td_k) {
  2355. continue
  2356. }
  2357. if len(indexMap) == 0 {
  2358. if isCanAddToIndexMap || (prevCanAddToIndexMap && len(tr.TDs) == 1) {
  2359. myPrevTdVal := ""
  2360. if td_index-2 >= 0 {
  2361. myPrevTdVal = tr.TDs[td_index-2].Val
  2362. }
  2363. if myPrevTdVal != "" && len([]rune(myPrevTdVal)) < 10 && ContactInfoMustReg.MatchString(myPrevTdVal) {
  2364. matchPrevFlag = true
  2365. }
  2366. indexMap[0] = k
  2367. break
  2368. }
  2369. } else {
  2370. indexMap = map[int]string{}
  2371. break LS
  2372. }
  2373. }
  2374. }
  2375. prevCanAddToIndexMap = isCanAddToIndexMap
  2376. isCanAddToIndexMap = false
  2377. }
  2378. if len(indexMap) > 0 {
  2379. allAscFind = false
  2380. }
  2381. }
  2382. //////
  2383. L:
  2384. for tr_index, tr := range tn.TRs {
  2385. thisTrHasMatch := false
  2386. jumpNextTd := false
  2387. for td_index, td := range tr.TDs {
  2388. //和|以?及|与|、多个词和在一起
  2389. if !jumpNextTd && len([]rune(td.Text)) >= 5 && len([]rune(td.Text)) <= 15 && regSplit.MatchString(td.Text) && td_index+1 < len(tr.TDs) {
  2390. thisTdVals := regSplit.Split(td.Text, -1)
  2391. nextTdVals := MultipleValueSplitReg.Split(tr.TDs[td_index+1].Val, -1)
  2392. if len(thisTdVals) == len(nextTdVals) {
  2393. isHandle := false
  2394. for _, k := range HasOrderContactType(td.Text) {
  2395. if ContactType[k].MatchString(td.Text) {
  2396. for thisTdVals_k, thisTdVals_v := range thisTdVals {
  2397. thisTdVals_v = strings.TrimSpace(thisTdVals_v)
  2398. if ContactType[k].MatchString(thisTdVals_v) {
  2399. thisTrHasMatch = true
  2400. tr.TDs[td_index+1].SortKV.AddKey(thisTdVals_v, nextTdVals[thisTdVals_k])
  2401. continue
  2402. }
  2403. if !ContactInfoMustReg.MatchString(thisTdVals_v) {
  2404. continue
  2405. }
  2406. jumpNextTd = true
  2407. thisTrHasMatch = true
  2408. tr.TDs[td_index+1].SortKV.AddKey(k+thisTdVals_v, nextTdVals[thisTdVals_k])
  2409. }
  2410. break
  2411. }
  2412. }
  2413. if !isHandle && len(indexMap) > 0 {
  2414. _, onlyContactType := u.FirstKeyValueInMap(indexMap)
  2415. if myContactType, _ := onlyContactType.(string); myContactType != "" {
  2416. for thisTdVals_k, thisTdVals_v := range thisTdVals {
  2417. thisTdVals_v = strings.TrimSpace(thisTdVals_v)
  2418. if ContactInfoMustReg.MatchString(thisTdVals_v) {
  2419. jumpNextTd = true
  2420. thisTrHasMatch = true
  2421. tr.TDs[td_index+1].SortKV.AddKey(myContactType+thisTdVals_v, nextTdVals[thisTdVals_k])
  2422. }
  2423. }
  2424. }
  2425. }
  2426. }
  2427. } else {
  2428. jumpNextTd = false
  2429. }
  2430. ///////////////////////////////////////
  2431. thisTdKvs := kvAfterDivideBlock(td.Text, 3)
  2432. if len(thisTdKvs) == 0 {
  2433. thisTdKvs = colonkvEntity.GetKvs(td.Text, "", 2)
  2434. }
  2435. if len(thisTdKvs) == 0 {
  2436. tdValue := regReplAllSpace.ReplaceAllString(td.Text, "")
  2437. if tdValue != "" && len([]rune(tdValue)) < 15 {
  2438. thisTdKvs = append(thisTdKvs, &u.Kv{
  2439. Key: tdValue,
  2440. Value: "",
  2441. })
  2442. }
  2443. }
  2444. tdAscFind := true
  2445. if len(thisTdKvs) == 0 {
  2446. continue
  2447. } else if allAscFind && len(thisTdKvs) >= 3 && len(indexMap) == 0 {
  2448. //采购人在联系人、电话后面的处理
  2449. isCanAddToIndexMap := false
  2450. LL:
  2451. for _, td_kv := range thisTdKvs {
  2452. //u.Debug(td_kv.PrevLine)
  2453. td_k := FilterContactKey(td_kv.Key)
  2454. td_k_length := len([]rune(td_k))
  2455. if td_k_length < 2 || td_k_length > 15 {
  2456. continue
  2457. }
  2458. isContinue := ContactInfoMustReg.MatchString(td_k)
  2459. if isContinue || (ContactInfoVagueReg.MatchString(td_k) && u.IsMapHasValue(td_k, ContactType)) {
  2460. if len(indexMap) > 0 {
  2461. indexMap = map[int]string{}
  2462. break LL
  2463. }
  2464. isCanAddToIndexMap = true
  2465. }
  2466. if isContinue {
  2467. continue
  2468. }
  2469. if len(indexMap) == 0 {
  2470. for _, k := range HasOrderContactType(td_k) {
  2471. if !ContactType[k].MatchString(td_k) {
  2472. continue
  2473. }
  2474. if isCanAddToIndexMap && len(indexMap) == 0 {
  2475. indexMap[0] = k
  2476. break
  2477. }
  2478. }
  2479. }
  2480. }
  2481. if len(indexMap) > 0 {
  2482. tdAscFind = false
  2483. }
  2484. }
  2485. prevKey := ""
  2486. oldIndexMapLength := len(indexMap)
  2487. thidTdIndex := td_index
  2488. notmatchCount := 0
  2489. kvTitle := ""
  2490. for _, td_kv := range thisTdKvs {
  2491. //u.Debug(td_kv.Key, td_kv.Value, td_kv.Title)
  2492. iscontinue := false
  2493. td_v := td_kv.Value
  2494. td_k := FilterContactKey(td_kv.Key)
  2495. td_k_length := len([]rune(td_k))
  2496. //
  2497. if allAscFind && tdAscFind {
  2498. for _, k := range HasOrderContactType(td_k) {
  2499. if td_k_length < 3 || td_k_length > 15 {
  2500. continue
  2501. }
  2502. if !ContactType[k].MatchString(td_k) {
  2503. matchCount++
  2504. continue
  2505. }
  2506. if weightMap[k] == nil {
  2507. weightMap[k] = map[string]interface{}{}
  2508. }
  2509. if ContactInfoVagueReg.MatchString(td_k) {
  2510. if matchMap[k] == nil {
  2511. matchMap[k] = map[string]bool{}
  2512. }
  2513. isAddToMatchMap := true
  2514. if !strings.HasSuffix(td_k, "方式") {
  2515. _, kTag := KvTagsToKV([]*u.Kv{&u.Kv{Key: td_k, Value: td_v}}, "", BuyerContacts, 3)
  2516. if len(kTag) == 1 {
  2517. tagVal, weightVal := u.FirstKeyValueInMap(kTag)
  2518. if tagVal == "采购单位联系人" && ContactBuyerPersonFilterReg.MatchString(td_v) {
  2519. isAddToMatchMap = false
  2520. }
  2521. if td.SortKV.Map[tagVal] != nil {
  2522. if weightMap[k][tagVal] == nil || (weightVal != nil && weightVal.(int) >= weightMap[k][tagVal].(int)) {
  2523. weightMap[k][tagVal] = weightVal.(int)
  2524. td.SortKV.AddKey(tagVal, td_v)
  2525. thisTrHasMatch = true
  2526. }
  2527. } else {
  2528. weightMap[k][tagVal] = weightVal.(int)
  2529. }
  2530. }
  2531. }
  2532. if isAddToMatchMap && !filterValue.MatchString(td_v) && td_v != "" {
  2533. matchMap[k][ContactInfoVagueReg.FindString(td_k)] = true
  2534. }
  2535. } else if k == "采购单位" { //打标签,权重高的重新覆盖
  2536. _, kTag := KvTagsToKV([]*u.Kv{td_kv}, "", []string{"采购单位"}, 3)
  2537. tagVal, weightVal := u.FirstKeyValueInMap(kTag)
  2538. if tagVal == k {
  2539. if weightMap[k][k] == nil || (weightVal != nil && weightVal.(int) >= weightMap[k][k].(int)) || len(matchMap[k]) == 0 {
  2540. weightMap[k][k] = weightVal.(int)
  2541. matchMap[k] = map[string]bool{}
  2542. indexMap = map[int]string{}
  2543. }
  2544. }
  2545. }
  2546. if u.IsMapHasValue(k, indexMap) {
  2547. thisTrHasMatch = true
  2548. iscontinue = true
  2549. continue
  2550. }
  2551. if reCreate {
  2552. indexMap = map[int]string{}
  2553. reCreate = false
  2554. }
  2555. indexMap[thidTdIndex] = k
  2556. iscontinue = true
  2557. thisTrHasMatch = true
  2558. thidTdIndex++
  2559. break
  2560. }
  2561. if len(indexMap) == 0 {
  2562. prevLine := FilterSerial.ReplaceAllString(td_kv.PrevLine, "")
  2563. for k, v := range ContactType {
  2564. if u.IsArrayHasValue(prevLine, v.FindAllString(prevLine, -1)) {
  2565. indexMap[thidTdIndex] = k
  2566. thisTrHasMatch = true
  2567. thidTdIndex++
  2568. }
  2569. }
  2570. }
  2571. if len(indexMap) == 0 {
  2572. if titleMatchType := ContactTypeTitleMatch(td_kv.Title); titleMatchType != "" {
  2573. thidTdIndex = 0
  2574. matchMap = map[string]map[string]bool{}
  2575. indexMap = map[int]string{1: titleMatchType}
  2576. }
  2577. }
  2578. }
  2579. if iscontinue {
  2580. continue
  2581. }
  2582. //不在同一块中
  2583. if td_kv.Title != "" && kvTitle != td_kv.Title && len(indexMap) > 0 && !ContactInfoMustReg.MatchString(td_kv.Key) {
  2584. thidTdIndex = 0
  2585. matchMap = map[string]map[string]bool{}
  2586. indexMap = map[int]string{}
  2587. }
  2588. kvTitle = td_kv.Title
  2589. //u.Debug(indexMap, td_k, td_v, matchMap)
  2590. if len(indexMap) > 0 {
  2591. if td_k_length < 2 || td_k_length > 10 {
  2592. continue
  2593. }
  2594. modle := 0
  2595. if len(thisTdKvs) == 1 {
  2596. if regReplAllSpace.ReplaceAllString(thisTdKvs[0].Value, "") == "" {
  2597. modle = 1
  2598. } else {
  2599. modle = 2
  2600. }
  2601. }
  2602. if !ContactInfoMustReg.MatchString(td_k) {
  2603. notmatchCount++
  2604. if notmatchCount < len(indexMap)*2 && false {
  2605. notmatchCount = 0
  2606. thidTdIndex = 0
  2607. indexMap = map[int]string{}
  2608. matchMap = map[string]map[string]bool{}
  2609. }
  2610. if mustMatchFirst {
  2611. break L
  2612. }
  2613. continue
  2614. }
  2615. reCreate = true
  2616. index := td_index
  2617. if oldIndexMapLength == 0 && len(indexMap) > 1 {
  2618. if prevKey != td_k {
  2619. prevKey = td_k
  2620. index = td_index
  2621. } else if prevKey == td_k {
  2622. index++
  2623. }
  2624. }
  2625. if filterValue.MatchString(td_v) {
  2626. thisTrHasMatch = true
  2627. continue
  2628. }
  2629. //u.Debug(indexMap, td_k, td_v, matchMap, index, modle)
  2630. myContactType := indexMap[index]
  2631. if myContactType == "" && len(indexMap) == 1 {
  2632. _, onlyContactType := u.FirstKeyValueInMap(indexMap)
  2633. myContactType, _ = onlyContactType.(string)
  2634. }
  2635. if myContactType == "" {
  2636. continue
  2637. }
  2638. matchCount++
  2639. if matchMap[myContactType] == nil {
  2640. matchMap[myContactType] = map[string]bool{}
  2641. }
  2642. if IsContactKvHandle(ContactInfoMustReg.FindString(td_k), matchMap[myContactType]) {
  2643. continue
  2644. }
  2645. matchMap[myContactType][ContactInfoMustReg.FindString(td_k)] = true
  2646. if ContactType[myContactType].MatchString(td_k) {
  2647. continue
  2648. }
  2649. thisTrHasMatch = true
  2650. if modle == 1 {
  2651. td.Text = myContactType + td_k
  2652. td.Val = td.Text
  2653. } else {
  2654. //
  2655. if !strings.HasSuffix(td_k, "方式") {
  2656. _, kTag := KvTagsToKV([]*u.Kv{&u.Kv{Key: myContactType + td_k, Value: td_v}}, "", BuyerContacts, 3)
  2657. if len(kTag) == 1 {
  2658. tagVal, _ := u.FirstKeyValueInMap(kTag)
  2659. if tagVal == "采购单位联系人" && ContactBuyerPersonFilterReg.MatchString(td_v) {
  2660. continue
  2661. }
  2662. if contactTypeTagMap[myContactType] == nil {
  2663. contactTypeTagMap[myContactType] = map[string][]interface{}{}
  2664. }
  2665. myOldKeyArray := contactTypeTagMap[myContactType][tagVal]
  2666. if myOldKeyArray != nil {
  2667. tn.TRs[myOldKeyArray[0].(int)].TDs[myOldKeyArray[1].(int)].SortKV.RemoveKey(myContactType + myOldKeyArray[2].(string))
  2668. } else {
  2669. contactTypeTagMap[myContactType][tagVal] = make([]interface{}, 3)
  2670. }
  2671. if weightMap[myContactType] == nil {
  2672. weightMap[myContactType] = map[string]interface{}{}
  2673. }
  2674. weightMap[myContactType][tagVal] = 1
  2675. contactTypeTagMap[myContactType][tagVal] = []interface{}{tr_index, td_index, td_k}
  2676. }
  2677. }
  2678. td.SortKV.AddKey(myContactType+td_k, td_v)
  2679. }
  2680. }
  2681. }
  2682. //u.Debug(td.SortKV.Map)
  2683. }
  2684. if allAscFind && !thisTrHasMatch {
  2685. notMatchTrCount++
  2686. if notMatchTrCount >= 2 {
  2687. notMatchTrCount = 0
  2688. indexMap = map[int]string{}
  2689. }
  2690. }
  2691. }
  2692. //u.Debug("end", matchCount, indexMap, matchMap)
  2693. if matchCount == 0 {
  2694. indexMap = map[int]string{}
  2695. matchMap = map[string]map[string]bool{}
  2696. }
  2697. (*contactFormat).IndexMap = indexMap
  2698. (*contactFormat).MatchMap = matchMap
  2699. // for _, tr := range tn.TRs {
  2700. // for _, td := range tr.TDs {
  2701. // log.Println(td.SortKV.Map)
  2702. // }
  2703. // }
  2704. }
  2705. func (table *Table) analyBrand() {
  2706. //5c2d8c05a5cb26b9b782572b
  2707. //产品名称 品牌 规格 单价 单位 数量 小计 质保期
  2708. lineMapArr := make(map[string]*SortMap)
  2709. lineMap := make(map[string]*SortMap)
  2710. brandRule := u.BrandRules
  2711. //将val为数组和string的分开
  2712. for _, key := range table.SortKV.Keys { //遍历table.SortKV.Keys而不是直接遍历table.SortKV.Map是为了得到table头的顺序
  2713. val := table.SortKV.Map[key]
  2714. key = regReplAllSpace.ReplaceAllString(key, "")
  2715. key = strings.Replace(key, "", "", -1) //处理一个特殊的采购量 经上层处理空格后未处理掉
  2716. if realTypeVal, ok := val.([]string); ok { //val为数组 {"数量":["1","2","3"]}
  2717. /*
  2718. {
  2719. "商品":["",""],
  2720. "商品_"["",""],
  2721. }
  2722. */
  2723. valArr, allempty := filterVal(realTypeVal...) //过滤数据
  2724. if allempty {
  2725. continue
  2726. }
  2727. realTypeVal = valArr
  2728. line := underline.FindString(key)
  2729. lineValMap1 := lineMapArr[line]
  2730. // i := 1
  2731. // L:
  2732. // for { //去除数组空数据
  2733. // last := realTypeVal[len(realTypeVal)-i]
  2734. // if last == "" {
  2735. // i++
  2736. // if i > len(realTypeVal) {
  2737. // break
  2738. // }
  2739. // goto L
  2740. // } else {
  2741. // break
  2742. // }
  2743. // }
  2744. // dislodgeNull := realTypeVal[:(len(realTypeVal) - i + 1)] //去除数组中空数据
  2745. if len(realTypeVal) > 0 {
  2746. if lineValMap1 == nil {
  2747. tmp := NewSortMap()
  2748. tmp.AddKey(key, realTypeVal)
  2749. lineMapArr[line] = tmp
  2750. } else {
  2751. lineValMap1.AddKey(key, realTypeVal)
  2752. }
  2753. }
  2754. //qutil.Debug("lineMapArr---", lineMapArr[line].Keys, lineMapArr[line].Map)
  2755. } else if realTypeVal, b := val.(string); b { //val为字符串 {"数量":"1"}
  2756. /*
  2757. {
  2758. "商品:"",名称:"",
  2759. "商品_:"",名称_:"",
  2760. "商品__:"",名称__:"",
  2761. }
  2762. */
  2763. valArr, allempty := filterVal(realTypeVal) //过滤数据
  2764. if allempty {
  2765. continue
  2766. }
  2767. realTypeVal = valArr[0]
  2768. line := underline.FindString(key)
  2769. lineValMap2 := lineMap[line]
  2770. if lineValMap2 == nil {
  2771. tmp := NewSortMap()
  2772. tmp.AddKey(key, realTypeVal)
  2773. lineMap[line] = tmp
  2774. } else {
  2775. lineValMap2.AddKey(key, realTypeVal)
  2776. }
  2777. //qutil.Debug("lineMap---", lineMap[line].Keys, lineMap[line].Map)
  2778. } else {
  2779. // "_id" : ObjectId("5c2c3802a5cb26b9b78646c4")5c2b0551a5cb26b9b7cb05db否5c2a42e6a5cb26b9b763ba5a采购人:一、采购人5c2b06f5a5cb26b9b7cc4409
  2780. //成交供应商排名 [map[entname:昆明合优科技有限公司 sortstr:第一中标候选人 sort:1] map[sort:2 entname:昆明厚起科技有限公司 sortstr:第二中标候选人] map[entname:云南远安科技发展有限公司 sortstr:第三中标候选人 sort:3]]
  2781. //qutil.Debug("err data:", key, val)
  2782. }
  2783. }
  2784. //处理数组数据后,匹配必须title和替换要保存的title
  2785. //qutil.Debug("lineMapArr----", len(lineMapArr))
  2786. if len(lineMapArr) > 0 {
  2787. for _, aMap := range lineMapArr {
  2788. maxNum := 0
  2789. arrcount1 := 0 //记录key是否存在必须title(数组数据)
  2790. arrcount2 := 0
  2791. ka := make(map[string][]string) //最终存储数据
  2792. //qutil.Debug("aMap.Keys----", aMap.Keys)
  2793. for _, k0 := range aMap.Keys {
  2794. match := false //记录must是否匹配到
  2795. v0 := aMap.Map[k0].([]string)
  2796. //匹配必须title
  2797. for nameM, r := range brandRule["must"] {
  2798. if convert(k0, r) { //匹配成功
  2799. v0tmp1 := v0
  2800. match = true
  2801. if len(ka[nameM]) != 0 && strings.Contains(k0, "描述") { //防止k0匹配到多次 和特殊情况 物料名称 物料描述同时出现
  2802. continue
  2803. }
  2804. if nameM == "itemname" || nameM == "modal" {
  2805. hasGoods(table, v0...) //判断itemname和modal中有没有商品
  2806. if nameM == "itemname" {
  2807. v0tmp1 = filterItem(v0...) //过滤itemname
  2808. }
  2809. }
  2810. if nameM == "brandname" || nameM == "modal" {
  2811. if len(ka["brandname"]) == 0 {
  2812. brand, allNull := hasBrand(table, v0...)
  2813. if !allNull {
  2814. ka["brandname"] = brand
  2815. }
  2816. }
  2817. }
  2818. //unitprice
  2819. if nameM == "unitprice" { //处理金额
  2820. v0tmp1 = dealPrice(k0, v0...)
  2821. }
  2822. if nameM != "brandname" && len(ka[nameM]) == 0 {
  2823. ka[nameM] = v0tmp1
  2824. }
  2825. arrcount1++
  2826. }
  2827. }
  2828. //替换其它要保存字段
  2829. if !match { //must未匹配,匹配replace
  2830. for nameR, r := range brandRule["replace"] {
  2831. if convert(k0, r) { //匹配成功
  2832. v0tmp2 := v0
  2833. //totalprice
  2834. if nameR == "totalprice" { //处理金额
  2835. v0tmp2 = dealPrice(k0, v0...)
  2836. }
  2837. //number
  2838. if nameR == "number" { //处理数量
  2839. uname0 := []string{}
  2840. v0tmp2, uname0 = dealNumber(v0...)
  2841. if len(ka["unitname"]) == 0 && len(uname0) != 0 {
  2842. ka["unitname"] = uname0
  2843. }
  2844. }
  2845. if len(v0tmp2) > 0 {
  2846. ka[nameR] = v0tmp2
  2847. }
  2848. arrcount2++
  2849. }
  2850. }
  2851. }
  2852. }
  2853. //找最终存储数据的最小len(arr)
  2854. // for _, vf := range ka {
  2855. // //找最短的数组
  2856. // lenVal := len(vf)
  2857. // if minNum == 0 || minNum > lenVal { //maxNum = len(最短数组)
  2858. // minNum = lenVal
  2859. // }
  2860. // }
  2861. //找最终存储数据的最大len(arr),小的补空
  2862. for _, vf1 := range ka {
  2863. lenVal := len(vf1)
  2864. if lenVal > maxNum {
  2865. maxNum = lenVal
  2866. }
  2867. }
  2868. finishKa := make(map[string][]string)
  2869. for vf2K, vf2 := range ka {
  2870. if len(vf2) < maxNum {
  2871. lenMv := maxNum - len(vf2)
  2872. for i := 0; i < lenMv; i++ {
  2873. vf2 = append(vf2, "")
  2874. }
  2875. }
  2876. finishKa[vf2K] = vf2
  2877. }
  2878. hasKey(table, arrcount1) //是否匹配到table中的标题
  2879. //qutil.Debug("finishKa----", finishKa)
  2880. if arrcount1 >= 1 {
  2881. if arrcount1+arrcount2 == 1 { //删除只匹配到一个价钱(总价)
  2882. delete(finishKa, "unitprice")
  2883. }
  2884. finishData := dealArrData(maxNum, finishKa)
  2885. table.BrandData = append(table.BrandData, finishData)
  2886. }
  2887. }
  2888. }
  2889. //处理string数据后,匹配必须title和替换要保存的title
  2890. //qutil.Debug("lineMap----", len(lineMap))
  2891. if len(lineMap) > 0 {
  2892. for _, sMap := range lineMap {
  2893. strcount1 := 0 //记录key是否存在必须title(字符串数据)
  2894. strcount2 := 0
  2895. endStrMap := make(map[string]string)
  2896. //qutil.Debug(k, "aMap.Keys----", sMap.Keys)
  2897. for _, k1 := range sMap.Keys {
  2898. match := false //记录must是否匹配到
  2899. v1 := qutil.ObjToString(sMap.Map[k1])
  2900. // for k1, v1 := range sMap {
  2901. //qutil.Debug(k1, "++++++++++", v1)
  2902. if v1 == "" {
  2903. continue
  2904. }
  2905. //匹配必须title
  2906. for nameM, r := range brandRule["must"] {
  2907. if convert(k1, r) { //匹配成功
  2908. v1tmp1 := v1
  2909. match = true
  2910. if nameM == "itemname" || nameM == "modal" { //特殊处理itemname
  2911. hasGoods(table, v1)
  2912. if nameM == "itemname" {
  2913. v1tmp1 = filterItem(v1)[0] //过滤itemname
  2914. if v1tmp1 == "" {
  2915. break
  2916. }
  2917. }
  2918. }
  2919. if nameM == "brandname" || nameM == "modal" { //特殊处理brandname
  2920. if endStrMap["brandname"] == "" {
  2921. brand, allNull := hasBrand(table, v1)
  2922. if !allNull {
  2923. endStrMap["brandname"] = brand[0]
  2924. }
  2925. }
  2926. }
  2927. //unitprice
  2928. if nameM == "unitprice" { //处理金额
  2929. v1tmp1 = dealPrice(k1, v1)[0]
  2930. }
  2931. if nameM != "brandname" && endStrMap[nameM] == "" {
  2932. endStrMap[nameM] = v1tmp1
  2933. }
  2934. strcount1++
  2935. }
  2936. }
  2937. //替换其它要保存字段
  2938. if !match {
  2939. for nameR, r := range brandRule["replace"] {
  2940. if convert(k1, r) { //匹配成功
  2941. v1tmp2 := v1
  2942. //totalprice
  2943. if nameR == "totalprice" { //处理金额
  2944. v1tmp2 = dealPrice(k1, v1)[0]
  2945. }
  2946. //number
  2947. if nameR == "number" { //处理数量
  2948. varr1, uname1 := dealNumber(v1)
  2949. v1tmp2 = varr1[0]
  2950. //从number中获取到的单位
  2951. if endStrMap["unitname"] == "" && uname1[0] != "" {
  2952. endStrMap["unitname"] = uname1[0]
  2953. }
  2954. }
  2955. if v1tmp2 != "" {
  2956. endStrMap[nameR] = v1tmp2
  2957. }
  2958. strcount2++
  2959. }
  2960. }
  2961. }
  2962. //}
  2963. }
  2964. //原始字符串数据处理
  2965. hasKey(table, strcount1) //是否匹配到table中的标题
  2966. //qutil.Debug("endStrMap----", endStrMap)
  2967. if strcount1 >= 1 {
  2968. if strcount1+strcount2 == 1 { //删除只匹配到一个价钱(总价)
  2969. delete(endStrMap, "unitprice")
  2970. }
  2971. finishData := dealStrData(endStrMap) //处理数据
  2972. if len(finishData) > 0 {
  2973. table.BrandData = append(table.BrandData, finishData)
  2974. }
  2975. }
  2976. }
  2977. }
  2978. }
  2979. func dealArrData(maxNum int, ka map[string][]string) []map[string]string {
  2980. for k2, v2 := range ka {
  2981. //处理数组长度不相等,使长度一致
  2982. if len(v2) > maxNum {
  2983. ka[k2] = v2[:maxNum]
  2984. }
  2985. }
  2986. finalData := assembleData(ka, 1)
  2987. if len(finalData) > 0 {
  2988. return finalData
  2989. }
  2990. return nil
  2991. }
  2992. func dealStrData(kv map[string]string) []map[string]string {
  2993. finalData := []map[string]string{}
  2994. if len(kv) > 0 {
  2995. finalData = assembleData(kv, 2)
  2996. }
  2997. return finalData
  2998. }
  2999. //组装数据,每一行的数据为一数据集合
  3000. func assembleData(m interface{}, n int) []map[string]string {
  3001. defer qutil.Catch()
  3002. /*
  3003. {
  3004. "itemname":["计算机","打印机","机柜"],
  3005. "number" :["1","12","4"]
  3006. }
  3007. */
  3008. datas := []map[string]string{}
  3009. if n == 1 { //数组数据
  3010. realTypeM := m.(map[string][]string)
  3011. //根据数组数据的顺序 将多个数组中索引相同的数据拼装成一个map,并将这多个map放入一个arr
  3012. /*
  3013. arr1 ["a1","b1","c1"]
  3014. arr2 ["a2","b2","c2"]
  3015. [
  3016. {"a1","a2"},
  3017. {"b1","b2"},
  3018. {"c1","c2"}
  3019. ]
  3020. */
  3021. //start
  3022. for k3, v3 := range realTypeM {
  3023. for _, val := range v3 {
  3024. data := make(map[string]string)
  3025. data[k3] = val
  3026. datas = append(datas, data)
  3027. }
  3028. break
  3029. }
  3030. for i, data := range datas {
  3031. for k4, v4 := range realTypeM {
  3032. if i < len(v4) { //数组数据长度不一致
  3033. if v4[i] != " " {
  3034. data[k4] = v4[i]
  3035. } else {
  3036. delete(data, k4)
  3037. }
  3038. } else {
  3039. fmt.Println("err table")
  3040. }
  3041. }
  3042. datas[i] = data
  3043. }
  3044. //end
  3045. for _, fdv := range datas { //清除空数据和只含特殊符号的数据
  3046. for fmk, fmv := range fdv {
  3047. if tabletdclear.ReplaceAllString(fmv, "") == "" {
  3048. delete(fdv, fmk)
  3049. }
  3050. }
  3051. }
  3052. } else { //字符串数据
  3053. realTypeM := m.(map[string]string)
  3054. datas = append(datas, realTypeM)
  3055. }
  3056. return datas
  3057. }
  3058. ////组装数据,每一行的数据为一数据集合
  3059. //func assembleData(m interface{}, n int) []map[string]string {
  3060. // defer qutil.Catch()
  3061. // /*
  3062. // {
  3063. // "itemname":["计算机","打印机","机柜"],
  3064. // "number" :["1","12","4"]
  3065. // }
  3066. // */
  3067. // datas := []map[string]string{}
  3068. // switch reflect.TypeOf(m).String() {
  3069. // case "map[string][]string": //数组数据
  3070. // realTypeM := m.(map[string][]string)
  3071. // //根据数组数据的顺序 将多个数组中索引相同的数据拼装成一个map,并将这多个map放入一个arr
  3072. // /*
  3073. // arr1 ["a1","b1","c1"]
  3074. // arr2 ["a2","b2","c2"]
  3075. // [
  3076. // {"a1","a2"},
  3077. // {"b1","b2"},
  3078. // {"c1","c2"}
  3079. // ]
  3080. // */
  3081. // //start
  3082. // for k3, v3 := range realTypeM {
  3083. // for _, val := range v3 {
  3084. // data := make(map[string]string)
  3085. // data[k3] = val
  3086. // datas = append(datas, data)
  3087. // }
  3088. // break
  3089. // }
  3090. // for i, data := range datas {
  3091. // for k4, v4 := range realTypeM {
  3092. // if i < len(v4) { //数组数据长度不一致
  3093. // if v4[i] != " " {
  3094. // data[k4] = v4[i]
  3095. // } else {
  3096. // delete(data, k4)
  3097. // //continue
  3098. // }
  3099. // } else {
  3100. // fmt.Println("err table")
  3101. // //continue
  3102. // }
  3103. // }
  3104. // datas[i] = data
  3105. // }
  3106. // //end
  3107. // // for _, fdv := range datas { //清除空数据和只含特殊符号的数据
  3108. // // for fmk, fmv := range fdv {
  3109. // // if tabletdclear.ReplaceAllString(fmv, "") == "" {
  3110. // // delete(fdv, fmk)
  3111. // // }
  3112. // // }
  3113. // // }
  3114. // case "map[string]string": //字符串数据
  3115. // realTypeM := m.(map[string]string)
  3116. // datas = append(datas, realTypeM)
  3117. // default:
  3118. // }
  3119. // return datas
  3120. //}
  3121. func convert(key, r string) bool {
  3122. defer qutil.Catch()
  3123. flag := false
  3124. key = tabletitleclear.ReplaceAllString(key, "")
  3125. reg, err := regexp.Compile(r)
  3126. if err != nil {
  3127. fmt.Println("reg err:", err)
  3128. return false
  3129. }
  3130. flag = reg.MatchString(key)
  3131. return flag
  3132. }
  3133. func hasKey(table *Table, n int) {
  3134. defer qutil.Catch()
  3135. if table.TableResult.HasKey == 1 {
  3136. return
  3137. }
  3138. if n >= 1 {
  3139. table.TableResult.HasKey = 1
  3140. }
  3141. }
  3142. func hasGoods(table *Table, data ...string) {
  3143. defer qutil.Catch()
  3144. goodsArr := make([]string, len(data))
  3145. //fmt.Println("table.TableResult.HasGoods=====", table.TableResult.HasGoods)
  3146. if table.TableResult.HasGoods == 1 {
  3147. return
  3148. }
  3149. for i, d := range data {
  3150. if d != "" {
  3151. goods := u.GoodsGet.CheckSensitiveWord(d)
  3152. //fmt.Println("goods======", goods)
  3153. goodsArr[i] = goods
  3154. if len(goods) > 0 {
  3155. table.TableResult.HasGoods = 1
  3156. break
  3157. }
  3158. }
  3159. }
  3160. }
  3161. //func hasBrand(table *Table, data ...string) {
  3162. // defer qutil.Catch()
  3163. // if table.TableResult.HasBrand == 1 {
  3164. // return
  3165. // }
  3166. // for i, d := range data {
  3167. // if d != "" {
  3168. // brand := u.BrandGet.CheckSensitiveWord(d)
  3169. // qutil.Debug(d, brand)
  3170. // if brand != "" {
  3171. // table.TableResult.HasBrand = 1
  3172. // break
  3173. // }
  3174. // }
  3175. // }
  3176. //}
  3177. func hasBrand(table *Table, data ...string) ([]string, bool) {
  3178. defer qutil.Catch()
  3179. //fmt.Println("table.TableResult.HasBrand---------", table.TableResult.HasBrand)
  3180. brandArr := make([]string, len(data))
  3181. // if table.TableResult.HasBrand == 1 {
  3182. // return brandArr, 1
  3183. // }
  3184. allNull := true
  3185. for i, d := range data {
  3186. //if d != "" {
  3187. brand := u.BrandGet.CheckSensitiveWord(d)
  3188. if brand != "" {
  3189. allNull = false
  3190. }
  3191. //fmt.Println("brand======", brand)
  3192. brandArr[i] = brand
  3193. if len(brand) > 0 {
  3194. table.TableResult.HasBrand = 1
  3195. }
  3196. //}
  3197. }
  3198. return brandArr, allNull
  3199. }
  3200. //过滤td值
  3201. func filterVal(val ...string) ([]string, bool) {
  3202. defer qutil.Catch()
  3203. n := 0 //记录被过滤的个数
  3204. for i, v := range val {
  3205. afterFilter := tabletdclear.ReplaceAllString(v, "")
  3206. afterFilter = NullVal.ReplaceAllString(afterFilter, "")
  3207. if afterFilter == "" {
  3208. n++
  3209. }
  3210. val[i] = afterFilter
  3211. }
  3212. allempty := false
  3213. if n == len(val) { //所有都被过滤掉
  3214. allempty = true
  3215. }
  3216. return val, allempty
  3217. }
  3218. //过滤itemname全是数字
  3219. func filterItem(itemval ...string) []string {
  3220. defer qutil.Catch()
  3221. result := []string{}
  3222. for _, v := range itemval {
  3223. afterFilter := numclear.ReplaceAllString(v, "")
  3224. if afterFilter != "" {
  3225. result = append(result, v)
  3226. } else {
  3227. result = append(result, afterFilter)
  3228. }
  3229. }
  3230. return result
  3231. }
  3232. //处理价格
  3233. func dealPrice(key string, val ...string) []string {
  3234. defer qutil.Catch()
  3235. iswan := strings.Contains(key, "万") //表格title中带有万
  3236. result := []string{}
  3237. for _, v := range val { //1.00万元 1元
  3238. tmparr := strings.Split(v, ".")
  3239. tmparr[0] = moneyNum.ReplaceAllString(tmparr[0], "")
  3240. if iswan {
  3241. result = append(result, tmparr[0]+"0000")
  3242. } else {
  3243. if strings.Contains(v, "万") { //价格中带有万
  3244. result = append(result, tmparr[0]+"0000")
  3245. } else {
  3246. result = append(result, tmparr[0])
  3247. }
  3248. }
  3249. }
  3250. return result
  3251. }
  3252. //处理number
  3253. func dealNumber(val ...string) ([]string, []string) {
  3254. defer qutil.Catch()
  3255. unitnameArr := []string{}
  3256. result := []string{}
  3257. for _, v := range val { //1个 1.00个
  3258. n := numclear.FindString(v)
  3259. unitname := numclear.ReplaceAllString(v, "") //匹配个数后的单位
  3260. unitnameArr = append(unitnameArr, unitname)
  3261. //val[i] = strings.Split(n, ".")[0]
  3262. result = append(result, strings.Split(n, ".")[0])
  3263. }
  3264. return result, unitnameArr
  3265. }