python分类查询
来源:互联网 发布:淘宝免单群是怎么运作 编辑:程序博客网 时间:2024/05/16 16:11
#!/usr/bin/python#-*- coding: UTF-8 -*-import os, sys, string, codecs# 设置字符集reload(sys)sys.setdefaultencoding("utf-8")# 将比赛ID, 玩家id加入def AddMapKeySetVal(Map, Key, Val): if Map.has_key(Key): Map[Key].add(Val) else: Map[Key] = set() Map[Key].add(Val)def RemoveOneVal(Map, Key, Val): if Map.has_key(Key): Map[Key].discard(Val)def RemoveKey(Map, Key): if Map.has_key(Key): del Map[Key]def PrintMap(file, Map): count = 0 line = "" userDic = {}; userList = []; for (Key, Val) in Map.items(): for userid in Val: line += "%s\n" % userid count += 1; if count%100 == 0: #print line file.write(line) line = "" file.write(line)# 获取长字符串中,两个字符串中间的值def getValue(srcStr, destStr1, destStr2): start = srcStr.find(destStr1) + len(destStr1) end = -1 if destStr2 != "": end = srcStr.find(destStr2) return srcStr[start:end]#处理matchserverlogdef handleMatchserverLog(fileName): matchDic = {} file = open(fileName) for line in file: # 处理用户加入的比赛 if line.find("user join match delcard, cardCount") > -1: matchId = getValue(line, "matchId:", ", userId:") userId = getValue(line, " userId:", "") AddMapKeySetVal(matchDic,matchId,userId) if line.find("user quit match addcard, cardCount") > -1: matchId = getValue(line, " matchId:", ", userId:") userId = getValue(line, " userId:", "") RemoveOneVal(matchDic, matchId, userId) if line.find("FinalRankingInfo matchID") > -1: matchId = getValue(line, " matchID:", " Order:") RemoveKey(matchDic, matchId) output = open('AddCardUserd_new.txt','a') PrintMap(output,matchDic) #print matchDicfileName = "2017-08-10_MatchServer(1).log"handleMatchserverLog(fileName)
阅读全文
0 0
- python分类查询
- 分类查询
- 表连接查询分类
- 表连接查询分类
- 无限分类子查询
- 鼻祖:查询意图分类
- 多分类产品查询
- sql分类显示查询
- 物料分类特性查询
- WordPress查询分类前几条
- sql 子分类查询
- 数据库分类查询
- SQL distinct 分类查询
- 子查询的分类
- MySQL join查询分类
- 分类查询框
- SQL查询详细分类
- 数据库查询语言分类
- ubuntu mysql5.7 改变数据目录
- Ajax实现动态刷新(Post)
- Failed to execute goal maven-javadoc-plugin-----在JDK8下maven-javadoc-plugin插件报错的问题
- C++ bool,char,short,int,long,float,double数据类型大小以及数据溢出值求解
- (HihoCoder
- python分类查询
- 构建高性能数据库缓存之redis主从复制
- 学习记录
- poj_1611_模拟递推_刚做过类似
- hello CSDN!
- 畅通工程
- codeforces Round 323D Once again(周期数列的最长非递减子序列)
- ios websocket的基本使用
- 项目总结