-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathuimethods.py
155 lines (134 loc) · 3.86 KB
/
uimethods.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
#!/usr/bin/env python
# encoding: utf-8
"""
uimethods.py
Created by 刘 智勇 on 2011-09-24.
Copyright (c) 2011 __MyCompanyName__. All rights reserved.
"""
#from huwai.apps.perm import PERM_CLASS
def ifNone(handler, v=None):
return v if v else ''
def truncate(handler, v, length=100):
return v[:length]
def affect(handler, affect, reference):
if isinstance(reference, int):
if isinstance(affect, list):
for a in affect:
if a == reference:return True
else:
return affect == reference
elif isinstance(reference, list):
if isinstance(affect, list):
for a in affect:
if a in reference:return True
else:
return (affect in reference)
elif isinstance(reference, dict):
s=reference.get('start', 0x00)
e=reference.get('end', 0x99)
if isinstance(affect, list):
for a in affect:
if (s <= a <= e):return True
else:
return (s <= affect <= e)
return False
def verify(handler, perm, reference):
if isinstance(reference, int):
if isinstance(perm, list):
for p in perm:
if p[0] == reference:return True
else:
return perm[0] == reference
elif isinstance(reference, list):
if isinstance(perm, list):
for p in perm:
if p[0] in reference:return True
else:
return (perm[0] in reference)
elif isinstance(reference, dict):
s=reference.get('start', 0x00)
e=reference.get('end', 0x99)
if isinstance(perm, list):
for p in perm:
if (s <= p[0] <= e):return True
else:
return (s <= perm[0] <= e)
return False
def list2txt(handler, v=None):
if isinstance(v, tuple):
return v[1]
elif isinstance(v, list):
return ','.join(map(lambda x: x[1], v))
elif isinstance(v, unicode) or isinstance(v, str):
return v
return ''
def dict2txt(handler, v=None):
if isinstance(v, dict):
return ''.join(v.values())
def cntDict(handler, l, **kwargs):
cnt = 0
for i in l:
plus = True
for k, v in kwargs.items():
if i.get(k, None) != v:
plus = False
if plus:cnt += 1
return cnt
def abstract(handler, c, n=100):
import re
try:
s = re.sub(r'</?\w+[^>]*>','',c)
except:
if c:
c = c.encode('utf-8')
s = re.sub(r'</?\w+[^>]*>','',c)
else:
return c
# s = s.replace(' ', '')
if (len(s) > n):
return s[:n-3] + '...'
else:
return s[:n]
def _locate(pid, l):
cnt = len(l)
if cnt == 0:return []
idx = 0
for i in xrange(0, cnt+1):
if l[i]['pid'] == pid:
idx = i
break
start = idx-2
end = idx+3
if start<0:
end -= start
start = 0
if end > cnt:
end = cnt
if end - start < 5:
start = max(0, end-5)
return start, end, idx
def flist(handler, pid, l):
start, end, idx = _locate(pid, l)
return l[start:end]
def per_index(handler, pid, l):
start, end, idx = _locate(pid, l)
return max(start, idx-1)
def next_index(handler, pid, l):
start, end, idx = _locate(pid, l)
return min(end-1, idx+1)
def build_params(handler, params):
l = []
for k, v in params.items():
s = str(k)+'='+str(v)
l.append(s)
return '&'.join(l)
def acnt(handler, owner, l):
for i in l:
if owner == i['owner']:
return i['count']
return 0
if __name__ == '__main__':
l = [{'pid':'a'}, {'pid':'b'}, {'pid':'c'}, {'pid':'d'}, {'pid':'e'}, {'pid':'f'}, {'pid':'g'}, {'pid':'h'}, {'pid':'i'}]
print next_index('handler', 'a', l)
#parms = {}{'day':'today', 'people':'lzy', 'place':'bj'}
#print build_params('handler', parms)