Time file information - class C++ Builder

 

class time_File

{

private:

TSearchRec modification;

TSystemTime d1,t1,d2,t2;

AnsiString FileN;

public:

time_File(AnsiString name);

AnsiString last_Modfication();

AnsiString create_File();

AnsiString last_Access();

};

time_File::time_File(AnsiString name)

{

FileN=name;

FindFirst(FileN,faAnyFile,modification);

FindClose(modification);

}

AnsiString time_File::last_Modfication()

{

return  (AnsiString) DateTimeToStr(FileDateToDateTime(modification.Time));

}

AnsiString time_File::create_File()

{

FileTimeToSystemTime(&(modification.FindData.ftCreationTime),&d1);

SystemTimeToTzSpecificLocalTime(NULL,&d1,&t1);

return (AnsiString) DateTimeToStr(SystemTimeToDateTime(t1));

}

AnsiString time_File::last_Access()

{

FileTimeToSystemTime(&(modification.FindData.ftLastAccessTime),&d2);

SystemTimeToTzSpecificLocalTime(NULL,&d2,&t2);

return (AnsiString) DateTimeToStr(SystemTimeToDateTime(t2));

}

void __fastcall TForm1::Button1Click(TObject *Sender)

{

  AnsiString name_Project=Application->ExeName;

  time_File info_File(name_Project);

  Label4->Caption=name_Project;

  Label1->Caption="Last modification: "+info_File.last_Modfication();

  Label2->Caption="Create time: "+info_File.create_File();

  Label3->Caption="Last access time: "+info_File.last_Access();

}

                

Sorting - C++ example

 

#include <iostream>

#include <stdlib.h>

#include <time.h>

#define kk 12

using namespace std;

void i_Sort(int* tab, int ssize1)

{

int i,j,k;

for(i=1;i<ssize1;i++)

{

j=i;

k=tab[j];

while((j>0) && (tab[j-1]>k))

{

tab[j]=tab[j-1];

j--;

}

tab[j]=k;

}

}

void z_Sort(int* tab, int ssize1)

{

int i,j,k;

for(i=1;i<ssize1;i++)

{

j=i;

k=tab[j];

while((j>0) && (tab[j-1]<k))

{

tab[j]=tab[j-1];

j--;

}

tab[j]=k;

}

}

int *tab1,*tab2,*tab3;

int main(int argc, char **argv)

{

 int i,j;

 srand(time(NULL));

 tab1=new int[kk];

 tab2=new int[kk];

 tab3=new int[kk];

 for(i=0;i<kk;i++)

 {

j=rand()%100;

tab1[i]=j;

tab2[i]=tab1[i];

tab3[i]=tab2[i];

 }

 i_Sort(tab2,kk);

 z_Sort(tab3,kk);

 cout<<"Original array: \n";

 for(i=0;i<kk;i++)

 {

cout<<tab1[i]<<"   ";

 }

 cout<<endl;

 cout<<"Descending sort: \n";

 for(i=0;i<kk;i++)

 {

cout<<tab3[i]<<"   ";

 }

 cout<<endl;

 cout<<"Ascending sort: \n";

 for(i=0;i<kk;i++)

 {

cout<<tab2[i]<<"   ";

 }

 cout<<endl;

 delete tab3;

 delete tab2;

 delete tab1;

 

return 0;

}