analytable.go 107 KB

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