Kla*_*avs 1 delphi algorithm split
我在ClientDataSet中有3条记录,结构如下:
数字:整数; 开始:TTime; 结束:TTime;
1; 9:00; 10:00 2; 9:30; 10:00 3; 9:40; 10:20
我必须将这些记录获取到其他ClientDataSet,如下所示:
1; 9:00; 9:30 2: 9:30; 9:40 3; 9:40; 10:00 4; 10:00; 10:20
使用TList<TTime>,用两列填充它,对其进行排序,然后遍历列表跳过重复项.像这样.
var l: TList<TTime>; t1, t2: TTime; id2: cardinal;
begin
l := TList<TTime>.Create;
try
cds1.First;
while not cds1.Eof do begin
l.Add( Frac(cds1.Fields[1].AsDateTime) );
l.Add( Frac(cds1.Fields[2].AsDateTime) );
cds1.Next;
end;
l.Sort;
cds2.Clear;
if l.Count <= 0 then exit;
t1 := l[0]; id2 := 0;
for t2 in l do begin
if t1 > t2 then raise Exception.create ('Sort silently failed!') else
if t1 < t2 then begin
Inc(id2);
cds2.AppendRecord([ id2, t1, t2 ]);
t1 := t2;
end;
end;
finally
l.Free;
end;
end;
Run Code Online (Sandbox Code Playgroud)
| 归档时间: |
|
| 查看次数: |
185 次 |
| 最近记录: |