zoukankan      html  css  js  c++  java
  • delphi把Clientdataset的Delta保存到数据库

     //ATableName-表名, AKeyField-主键,多个主键用;隔开,如 ;pid;times;  from:unit HlsImplBase;
    function THlsImplBase.UpdateTableData(ATableName, AKeyField: AnsiString; var AData: Variant): Boolean;
    var
      LSql: string;
      LDataSet: TDataSet;
      LProvider:  TProvider;
      LErrCount: Integer;
      I: Integer;
    begin
      Result := False;
      if ATableName = '' then Exit;
      if AKeyField = '' then Exit;
     
      LSql := 'select * from ' + ATableName + ' where 1 = 2';
      LDataSet := CreateDataSet(LSql);
      if not Assigned(LDataSet) then Exit;
     
      LProvider := TProvider.Create(nil);
      LProvider.UpdateMode := upWhereKeyOnly;
      LProvider.DataSet := LDataSet;
      AKeyField := LowerCase(AKeyField);
      for I := 0 to LDataSet.FieldCount - 1 do
      begin
        if (LowerCase(LDataSet.Fields[I].FieldName) = AKeyField) or
            (Pos(';' + LowerCase(LDataSet.Fields[I].FieldName) + ';', AKeyField) > 0) then
          LDataSet.Fields[I].ProviderFlags := LDataSet.Fields[I].ProviderFlags + [pfInKey]
        else
          LDataSet.Fields[I].ProviderFlags := [];
      end;
      try
        try
          LProvider.ApplyUpdates(AData, -1, LErrCount);
        except
        end;
        Result := LErrCount = 0;
      finally
        LDataSet.Free;
        LProvider.Free;
      end;
      
    end;
    好的代码像粥一样,都是用时间熬出来的
  • 相关阅读:
    Delphi7 (第一天:类的编写)
    设计模式(二)Abstract Factory
    hdu 3335(最小路径覆盖)
    hdu 2236(最大匹配+枚举上下界)
    hdu 2819(二分匹配)
    hdu 3861(缩点+最小路径覆盖)
    hdu 2831(贪心)
    hdu 4296(贪心)
    hdu 2354(bfs求最短路)
    hdu 4313(类似于kruskal)
  • 原文地址:https://www.cnblogs.com/jijm123/p/13435256.html
Copyright © 2011-2022 走看看