analytable.go 108 KB

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