Home | History | Annotate | Download | only in ADT

Lines Matching defs:Row

53   // array, only one row plus one element are used at a time, so this
54 // implementation just keeps one vector for the row. To update one entry,
56 // entry is in Row[x-1], the top entry is what's in Row[x] from the last
64 unsigned *Row = SmallBuffer;
66 Row = new unsigned[n + 1];
67 Allocated.reset(Row);
71 Row[i] = i;
74 Row[0] = y;
75 unsigned BestThisRow = Row[0];
79 int OldRow = Row[x];
81 Row[x] = std::min(
83 std::min(Row[x-1], Row[x])+1);
86 if (FromArray[y-1] == ToArray[x-1]) Row[x] = Previous;
87 else Row[x] = std::min(Row[x-1], Row[x]) + 1;
90 BestThisRow = std::min(BestThisRow, Row[x]);
97 unsigned Result = Row[n];