23 Compute_Delta(pedWorkArea_t   *WA,  in Compute_Delta()  argument
32     int32  max  = 1 + WA->Edit_Array_Lazy[k-1][d];  in Compute_Delta()
34     int32  j = WA->Edit_Array_Lazy[k-1][d-1];  in Compute_Delta()
41     j = 1 + WA->Edit_Array_Lazy[k-1][d+1];  in Compute_Delta()
49       WA->deltaStack[stackLen++] = max - last - 1;  in Compute_Delta()
51       last = WA->Edit_Array_Lazy[k-1][from];  in Compute_Delta()
55       WA->deltaStack[stackLen++] = last - (max - 1);  in Compute_Delta()
57       last = WA->Edit_Array_Lazy[k-1][from];  in Compute_Delta()
61   WA->deltaStack[stackLen++] = last + 1;  in Compute_Delta()
64     WA->delta[k++] = abs(WA->deltaStack[i]) * Sign(WA->deltaStack[i-1]);  in Compute_Delta()
66   WA->deltaLen = stackLen - 1;  in Compute_Delta()
88 Allocate_More_Edit_Space(pedWorkArea_t *WA) {  in Allocate_More_Edit_Space()  argument
94   int32  a = WA->alloc.size();  //  First unallocated block  in Allocate_More_Edit_Space()
96   while (WA->Edit_Array_Lazy[b] != NULL)  in Allocate_More_Edit_Space()
119   WA->alloc.push_back(alloc);  in Allocate_More_Edit_Space()
126          (e < WA->Edit_Array_Max)) {  in Allocate_More_Edit_Space()
127     WA->Edit_Array_Lazy[e++] = alloc + Offset;  in Allocate_More_Edit_Space()
164                  pedWorkArea_t *WA) {  in Prefix_Edit_Dist()  argument
172   WA->deltaLen = 0;  in Prefix_Edit_Dist()
182   if (WA->Edit_Array_Lazy[0] == NULL)  in Prefix_Edit_Dist()
183     Allocate_More_Edit_Space(WA);  in Prefix_Edit_Dist()
185   WA->Edit_Array_Lazy[0][0] = Row;  in Prefix_Edit_Dist()
204     if (WA->Edit_Array_Lazy[e] == NULL)  in Prefix_Edit_Dist()
205       Allocate_More_Edit_Space(WA);  in Prefix_Edit_Dist()
210     WA->Edit_Array_Lazy[e-1][Left]    = -2;  in Prefix_Edit_Dist()
211     WA->Edit_Array_Lazy[e-1][Left-1]  = -2;  in Prefix_Edit_Dist()
212     WA->Edit_Array_Lazy[e-1][Right]   = -2;  in Prefix_Edit_Dist()
213     WA->Edit_Array_Lazy[e-1][Right+1] = -2;  in Prefix_Edit_Dist()
216       Row = 1 + WA->Edit_Array_Lazy[e-1][d];  in Prefix_Edit_Dist()
217       Row = std::max(Row, WA->Edit_Array_Lazy[e-1][d-1]);  in Prefix_Edit_Dist()
218       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()
234             (1 + WA->Edit_Array_Lazy[e-1][d+1] == WA->Edit_Array_Lazy[e][d]) &&  in Prefix_Edit_Dist()
237           WA->Edit_Array_Lazy[e][d] = WA->Edit_Array_Lazy[e][d-1];  in Prefix_Edit_Dist()
244         Compute_Delta(WA, e, d, Row);  in Prefix_Edit_Dist()
251            && WA->Edit_Array_Lazy[e][Left] < WA->G->Edit_Match_Limit[e])  in Prefix_Edit_Dist()
256              && WA->Edit_Array_Lazy[e][Left] + Left < WA->G->Edit_Match_Limit[e])  in Prefix_Edit_Dist()
263            && WA->Edit_Array_Lazy[e][Right] + Right < WA->G->Edit_Match_Limit[e])  in Prefix_Edit_Dist()
267       while (WA->Edit_Array_Lazy[e][Right] < WA->G->Edit_Match_Limit[e])  in Prefix_Edit_Dist()
273       if (WA->Edit_Array_Lazy[e][d] > Longest) {  in Prefix_Edit_Dist()
276         Longest = WA->Edit_Array_Lazy[e][d];  in Prefix_Edit_Dist()
294   Compute_Delta(WA, Max_Score_Best_e, Max_Score_Best_d, Max_Score_Len);  in Prefix_Edit_Dist()