-
Notifications
You must be signed in to change notification settings - Fork 2
/
make_c.py
157 lines (146 loc) · 5.69 KB
/
make_c.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
152
153
154
155
156
import fix_uv
import func_ewt
from collections import deque
import copy
fix_temp = fix_uv
func = func_ewt
def make_c(lim_cu, contracted, a, i, u, full, poss, f, store_for_repeat, full_pos, i_c, menu):
for n in range(2, lim_cu+1, 2):
if n>2:
u_copy = deque([])
y = copy.deepcopy(u)
for x in range(n):
u_copy.append(copy.deepcopy(y))
if (y):
for item in y:
if item.pos == u_copy[-1][0].pos:
y.remove(item)
break
else :
return #if there are less no of operators the
#fn should return without any result
while True:
add = 0
u_tmp = []
u_2 = copy.deepcopy(u)
full_2 = copy.deepcopy(full)
#pick up all cumulants
for index in range(len(u_copy)):
u_tmp.append(u_copy[index][0])
for item in u_tmp :
if item.dag == '0': add=add-1
else : add=add+1
if add==0:
for item1 in u_tmp:
for item2 in u_2:
if item1.pos == item2.pos:
u_2.remove(item2)
break
for item2 in full_2:
if item1.pos == item2.pos:
full_2.remove(item2)
break
flag1 =0
contracted.append(u_tmp)
p_1=0 # if the charecter from string 1 is present or not
p_2=0
if (len(contracted)>0): # this stores all the multiple lanbda and stores them in a list, checks them to see redundancy
for item1 in store_for_repeat:
if func.equality_check(contracted, item1):
flag1 = 1
break
for item in u_tmp:
if item.string == 1:
p_1 = 1
else:
p_2 = 1
if (flag1 ==0 and p_1==1 and p_2==1) or menu == '1':
make_c(n, contracted, a, i, copy.deepcopy(u_2), copy.deepcopy(full_2), poss, f, store_for_repeat, full_pos, i_c, menu)#call the function again with smaller u
#if not u_2:
store_for_repeat.append(copy.deepcopy(contracted))
contracted.pop()
flag =1
x=-1
tmp_0 = deque([])
if len(u_copy[0])==n : break # break out of whole function
while flag == 1:
if (u_copy[x]):
u_copy[x].popleft()
if x>=(-len(u_copy[x])):
flag = 0
tmp_0 = copy.deepcopy(u_copy[x])
while x<-1:
x=x+1
tmp_0.popleft()
u_copy[x]=copy.deepcopy(tmp_0)
else :
x=x-1
elif n==2:
poss = deque([])
for operator in full:
y = deque([])
if menu == '1':
if operator.kind == 'pa' and operator.dag=='0':
for item in a:
if operator.pos<item.pos and item.dag=='1':
y.append(item)
elif operator.kind == 'ho' and operator.dag=='1':
for item in i:
if operator.pos<item.pos and item.dag=='0':
y.append(item)
elif operator.kind == 'ac': #because active states will have eta and gamma
for item in u:
if operator.pos<item.pos and int(item.dag)!=int(operator.dag):
y.append(item)
#if (y): remember that empty strings are also included
poss.append(y) #list of list in dictionary order i.e 1st annhilation -> possible creation then 2nd ...
else:
if operator.kind == 'pa' and operator.dag=='0':
for item in a:
if operator.pos<item.pos and item.dag=='1' and operator.string!=item.string:
y.append(item)
elif operator.kind == 'ho' and operator.dag=='1':
for item in i:
if operator.pos<item.pos and item.dag=='0' and operator.string != item.string:
y.append(item)
elif operator.kind == 'ac': #because active states will have eta and gamma
for item in u:
if operator.pos<item.pos and int(item.dag)!=int(operator.dag) and operator.string!=item.string:
y.append(item)
#if (y): remember that empty strings are also included
poss.append(y) #list of list in dictionary order i.e 1st annhilation -> possible creation then 2nd ...
no = len(full)/2
for lim_cnt in range(0, no+1):
if lim_cnt>0:
temp_list = copy.deepcopy(poss)
op_no=0
flag = 0
while (temp_list):
matched = []
contracted_l = []
contracted_r = []
while not flag:
if not temp_list[0]:
op_no=op_no+1
temp_list.popleft()
if not temp_list:
flag=1
else :
flag = 1
flag = 0
if temp_list:
contracted_l.append(full[op_no])
contracted_r.append(temp_list[0][0])
matched.append(full[op_no])
matched.append(temp_list[0][0])
temp_list[0].popleft()
fix_temp.fix_con(copy.copy(op_no), 1, lim_cnt, copy.deepcopy(temp_list), matched, contracted, contracted_l, contracted_r, a, i, u, full, f, full_pos, i_c)
matched.pop()
matched.pop()
else :
temp_list = deque([])
op_no = 0
matched = []
contracted_l = []
contracted_r = []
fix_temp.fix_con(copy.copy(op_no), 1, lim_cnt, copy.deepcopy(temp_list), matched, contracted, contracted_l, contracted_r, a, i, u, full, f, full_pos, i_c)