28 Compute_Delta(pedWorkArea_t   *WA,  in Compute_Delta()  argument
37     int32  max  = 1 + WA->Edit_Array_Lazy[k-1][d];  in Compute_Delta()
39     int32  j = WA->Edit_Array_Lazy[k-1][d-1];  in Compute_Delta()
46     j = 1 + WA->Edit_Array_Lazy[k-1][d+1];  in Compute_Delta()
54       WA->deltaStack[stackLen++] = max - last - 1;  in Compute_Delta()
56       last = WA->Edit_Array_Lazy[k-1][from];  in Compute_Delta()
60       WA->deltaStack[stackLen++] = last - (max - 1);  in Compute_Delta()
62       last = WA->Edit_Array_Lazy[k-1][from];  in Compute_Delta()
66   WA->deltaStack[stackLen++] = last + 1;  in Compute_Delta()
69     WA->delta[k++] = abs(WA->deltaStack[i]) * Sign(WA->deltaStack[i-1]);  in Compute_Delta()
71   WA->deltaLen = stackLen - 1;  in Compute_Delta()
93 Allocate_More_Edit_Space(pedWorkArea_t *WA) {  in Allocate_More_Edit_Space()  argument
99   int32  a = WA->alloc.size();  //  First unallocated block  in Allocate_More_Edit_Space()
101   while (WA->Edit_Array_Lazy[b] != NULL)  in Allocate_More_Edit_Space()
124   WA->alloc.push_back(alloc);  in Allocate_More_Edit_Space()
131          (e < WA->Edit_Array_Max)) {  in Allocate_More_Edit_Space()
132     WA->Edit_Array_Lazy[e++] = alloc + Offset;  in Allocate_More_Edit_Space()
169                  pedWorkArea_t *WA) {  in Prefix_Edit_Dist()  argument
177   WA->deltaLen = 0;  in Prefix_Edit_Dist()
185   if (WA->Edit_Array_Lazy[0] == NULL)  in Prefix_Edit_Dist()
186     Allocate_More_Edit_Space(WA);  in Prefix_Edit_Dist()
188   WA->Edit_Array_Lazy[0][0] = Row;  in Prefix_Edit_Dist()
206     if (WA->Edit_Array_Lazy[e] == NULL)  in Prefix_Edit_Dist()
207       Allocate_More_Edit_Space(WA);  in Prefix_Edit_Dist()
212     WA->Edit_Array_Lazy[e-1][Left]    = -2;  in Prefix_Edit_Dist()
213     WA->Edit_Array_Lazy[e-1][Left-1]  = -2;  in Prefix_Edit_Dist()
214     WA->Edit_Array_Lazy[e-1][Right]   = -2;  in Prefix_Edit_Dist()
215     WA->Edit_Array_Lazy[e-1][Right+1] = -2;  in Prefix_Edit_Dist()
218       Row = 1 + WA->Edit_Array_Lazy[e-1][d];  in Prefix_Edit_Dist()
219       Row = std::max(Row, WA->Edit_Array_Lazy[e-1][d-1]);  in Prefix_Edit_Dist()
220       Row = std::max(Row, WA->Edit_Array_Lazy[e-1][d+1] + 1);  in Prefix_Edit_Dist()
225       assert(e < WA->Edit_Array_Max);  in Prefix_Edit_Dist()
227       WA->Edit_Array_Lazy[e][d] = Row;  in Prefix_Edit_Dist()
233             (1 + WA->Edit_Array_Lazy[e-1][d+1] == WA->Edit_Array_Lazy[e][d]) &&  in Prefix_Edit_Dist()
236           WA->Edit_Array_Lazy[e][d] = WA->Edit_Array_Lazy[e][d-1];  in Prefix_Edit_Dist()
243         Compute_Delta(WA, e, d, Row);  in Prefix_Edit_Dist()
250            && WA->Edit_Array_Lazy[e][Left] < WA->G->Edit_Match_Limit[e])  in Prefix_Edit_Dist()
255              && WA->Edit_Array_Lazy[e][Left] + Left < WA->G->Edit_Match_Limit[e])  in Prefix_Edit_Dist()
262            && WA->Edit_Array_Lazy[e][Right] + Right < WA->G->Edit_Match_Limit[e])  in Prefix_Edit_Dist()
266       while (WA->Edit_Array_Lazy[e][Right] < WA->G->Edit_Match_Limit[e])  in Prefix_Edit_Dist()
272       if (WA->Edit_Array_Lazy[e][d] > Longest) {  in Prefix_Edit_Dist()
275         Longest = WA->Edit_Array_Lazy[e][d];  in Prefix_Edit_Dist()
286         (Best_e <= WA->G->Error_Bound[std::min(Longest, Longest + Best_d)])) {  in Prefix_Edit_Dist()
295   Compute_Delta(WA, Max_Score_Best_e, Max_Score_Best_d, Max_Score_Len);  in Prefix_Edit_Dist()