Cng ty CP Gii php Phn mm Doanh nghip - SSE

a ch: 23/63 V Trng Phng Thanh Xun H Ni in thoai: (+84 43) 568 2222; Fax: (+84 46) 2853 711 Website: www.sse.net.vn; Email: SSE@sse.net.vn

TI LIU O TO NI B

CC HM V PHP TNH C BN TRONG FOXPRO

M ti liu: NAME_DATE

Ngy Ngi lp Chc v Ph duyt Chc v

07/01/2010 Bi Vn D Lp trnh vin

Phn phi ti liu Hnh thc phn phi : Th in t Tn tp : ..\ ..\ tailieufox.doc

CNG TY CP GII PHP PHN MM DOANH NGHIP VPHN: 23/63 V Trng Phng Thanh Xun HN Tel: (84-43) 568 2222; (84-46) 2 853 710; Fax: (84-4) 2 853 711 Web: www.sse.net.vn; Email: sse@sse.net.vn

Ti liu Foxpro

STT 1 2 3 4 5 6

Kiu hm Create<file> Copy structure to <file>

Tc dng To mt File chp cu hnh ca mt file c sang mt file khc m file Np d liu vo bn ghi Chp mt b n ghi t mt bn ghi c Thm mt bn ghi trng vo cui tp nh v con tr ca bn ghi th n

Use < file> append append from < tn file> [ fields < ds trng>] [for < iu kin >] append blank go <n>

go top go bottom skip <[+][-]m> skip dbf()

Tin(li) bn ghi xung m v tr Li mt v tr Cho bit tn ca dbf ang m Cho bit s lng bn ghi cho bit s hiu bn ghi hin hnh tr v gi tr true nu bn ghi v tr u tr v gi tr true nu bn ghi v tr cui cng xem cu trc ca dbf v c yu cu in ra my in hoc in ra mt file mi Xem danh sch - <phm vi> All :tt c cc bn ghi record <n>: l bn ghi th n rest : l k t bn ghi hin ti cho n ht next <n> t bn ghi hin ti n bn ghi th n - for < iu kin >
2/8

reccount() recno() bof() eof() list structure [to printer/to file]

Hoc display structure [to printer/to file] list <phm vi> [danh sch trng][for< iu kin>] [ while < iu kin >] [ to file ] [ to printer]

10

SSE., JSC.

Ti liu Foxpro

STT

Kiu hm -

Tc dng iu kin cn lit k while< iu kin > iu kin dng li off tt ch hin s hiu danh sch trng xc nh mt dy cc trng cn hin th

11

Modify structure edit < phm vi >[fields< danh sch trng>][ for < iu kin >]

Sa cu trc trng

12

browse [fields< danh sch trng>][ for < iu kin >] browse browse fields< danh sch cc trng> < tn trng kt xut = biu thc > replace < trng > with < biu thc > [for < iu kin >] delete < phm vi > [for < iu kin >] [while < iu kin>] recall< phm vi > [for < iu kin >] [while <iu kin>] set delete on Pack Zap

Sa ni dung bn ghi

13 14 15 16 17 18 19

Tnh ton trng Sa i

gia

cc

nh du xo bn ghi Khi phc cc bn ghi xo t ch che i bn ghi nh du xo Xo hn cc bn ghi nh du Xo bn ghi vnh vin m khng cn phi nh du Chn mt bn ghi vo v tr m mnh mong mun khng c tham s s chn v tr cui cng blnk : chn vo v tr hin hnh before chn vo v tr trc v tr hin hnh Sao trch ti mt file cn
3/8

insert [blank][ before]

20

21
SSE., JSC.

copy to <tn file> [ < phm vi > ] [ fields < tn

Ti liu Foxpro

STT

Kiu hm trng >] [for < iu kin > ] [ while < iu kin > ] <with cdx> sort to < tn file > on < trng 1 > [ a]/ [d]/[c]...[for< iu kin >] [ while < iu kin > ] [ fields < tn trng >

Tc dng sao trch Sp xp trng theo mt trt t nht nh /a : theo chiu tng dn /d: theo chiu tng dn / c sp xp theo ch ci Sp xp cc bn ghi theo mt th t nht nh thng qua mt tp ch s du + l theo th t tng dn du l th t gim dn compact tp ch s s c nn unique ch c mt bn ghi u tin trong dbf c ghi s th t vo trong tp ch s additive : tp ch s c khng b ng li M cc tp ch s danh sch cc tp ch s order xc nh tp ch M cc tp ch s danh sch cc tp ch s order xc nh tp ch Xc nh tp ch Ch s ho li tt c cc tp ch s ang m sao cho ph hp vi trng thi mi ca dbf Xem trng thi ca dbf ndx (n) : tr li tn index c s th t n key(n) tr li biu thc kho ca tp
4/8

22

23

index on < +,- biu thc kho > to < tn tp > [ for < iu kin > ] [ compact] [ unique] [ additive]

24

set index to [ danh sch cc tp ch s [?] ] [order < biu thc s > / tn tp ch ] [ ASCENDING][ descending] [ additive]

25

use < tn dbf > index [ danh sch cc tp ch s [?] ] [order < biu thc s > / tn tp ch ] [ ASCENDING][ descending]

26

set index to [ biu thc s /< tn tp ch > ] ; asending/ desending reindex [compact]

27

display status 28

SSE., JSC.

Ti liu Foxpro

STT

Kiu hm

Tc dng idx c s th t n order () tr li s th t ca Master Index + ng tt c cc loi tp + ng cc tp ch s + Mi tp m km s b ng li

close all close index 29 close dbf set index to locate for < iu kin > [ < phm vi > ] 30 continue 31 32 seek< iu kin > set filter to < iu kin >

+ ng tt c cc tp ch s ang m trong vng. Tm kim mt bn ghi , tho mn mt iu kin no nh v ti cc bn ghi tip theo Dng tm kim nhanh khi sp xp cc ch s Dng lc cc bn ghi tho mn mt iu kin nht nh + Dng lc cc trng. + Mun s dng li danh sch nu

set fields to < danh sch trng > 33 set fields on

count [< phm vi > ] [ for < iu kin > ] [ while < iu kin >] [to < bin >] 34

Dng m cc bn ghi to < bin > gi gi tr vo bin khng c tu chn , n s m tt c cc bn ghi Tnh tng danh sch biu thc : dy cc biu thc phn cch nhau mt du phy , mi biu thc tng ng mt tng to bin : cc gi tr tng ny s c gi vo theo thc t tng ng ca vo danh sch bin Tnh gi tr trung bnh
5/8

sum [< phm vi > ] [ < danh sch biu thc > ] [for < iu kin >] [while < iu kin > ] [to <danh sch bin>]

35

36
SSE., JSC.

average [< phm vi > ] [ < danh sch biu thc > ] [for < iu kin >] [while < iu kin > ] [to

Ti liu Foxpro

STT <danh sch bin>]

Kiu hm calculate [< phm vi > ] [ < danh sch biu thc > ] [for < iu kin >] [while < iu kin > ] [to <danh sch bin>]

Tc dng danh sch biu thc c s dng bi cc hm mu sau CNT() m s bn ghi SUM(biu thc s) : dng tnh tng AVG ( biu thc s ) dng ly gi tr trung bnh STD ( biu thc s ) : tnh lch tiu chun VAR ( biu thc s ) tnh lch trung bnh Min ( biu thc ) tnh gi tr nh nht ca biu thc Max ( biu thc ) tnh gi tr ln nht ca biu thc Tnh tng v kt qu c ghi sang mt dbf mi . Gn b danh cho dbf Thay cho sellect < s hiu vng > Ti mt vng hin hnh c th m mt dbf trong vng khc bng lnh trn Cho bit b danh ca s hiu vng ang m Cho bit tn ca dbf ang m Cho bit s lng bn ghi ca tp Cho bit s hiu bn ghi hin hnh Kim tra v tr u tp Kim tra v tr cui tp

37

38

Total to < tn tp > on < biu thc kho > [ phm vi ] ; [ fields < danh sch trng > ] [ for < iu kin > ] [ while < iu kin >] use < tn dbf > allas < tn b danh > sellect < tn b danh > use < tn dbf > in < s hiu >

39

40

allas ([ < s hiu vng > ] ) DBF ([ < s hiu vng > ] ) recount ( [< s hiu vng > ]) recno ( [< s hiu vng >]) bof( [< s hiu vng >]) eof ( [< s hiu vng >]) 42
SSE., JSC.

41

update on < trng kho > from < b danh > ;replace < trng i > with < biu thc i > ... [ random]

cp nht d liu t cc dbf khc : tp c cp nht phi c m

6/8

Ti liu Foxpro

STT

Kiu hm

Tc dng vng hin hnh, cn tp cha d liu phi c m mt vng khc vi b danh trng i l trng ca tp hin hnh c cp nht bi cc gi tr tng ng bi cc biu thc th i Khng c random i hi c hai dbf phi c th t theo chiu tng dn theo < trng kho > m ch cn tp hin hnh. t mi quan h cho cc dbf additive : cc mi quan h s c thm vo khng c additive th cc mi quan h mi s thay th cho cc mi quan h c v cc cc mi quan h c s b hu b Gi lnh trong dos - Xem th mc Xem ni dung ca file number c dng hin s hiu ca mi dng trn bn ghi M ca s ging kiu chng trnh NC i tn file Xo file To File lp trnh Chy file lp trnh Ci t mng
7/8

Set relation to [< biu thc i >] into < b danh i > ...[ additive >

43

Run < lnh dos > 44 hoc ! lnh dos - Dir [< c t file >] [to printer] [ to <tn tp>] 45 Type < tn tp >[to printer] [ to <tn tp 2>][ number]

46 47 48 49 50 51
SSE., JSC.

Filer Rename < tn c > to < tn mi > Delete file < tn tp > hoc Erase < tn tp > Modify command < tn file > Do < tn file > Dimension <tn mng> (<n1>,n<2>)

Ti liu Foxpro

STT 52 53 54 55

Kiu hm Scatter fields < danh sch trng> [memo] to < tn mng > blank Gather from < tn mng >[ fields < list > ] [ < phm vi > ] [ For < k >] [ while < k >] Append from array < tn mng > [ < phm vi > ] [ For < iu kin >] [fields <danh sch trng >] Copy to array < tn mng > >[ fields < list > ] [ < phm vi > ] [ For < k >] [ while < k >] Ascan ( < mng >, gi tr , [n1] [n2] )

Tc dng Chuyn 1 record dng mng sang

Chuyn 1 mng sang trng. Chuyn dng mng sang trng. Chuyn tt c cc bn ghi sang mng Tm kim mt phn t c thuc mng hay khng ? N1 : bt u t phn t n1.

56

N2 : s phn t gii hn . Nu khng c n1 , my tnh s tm t u . Nu khng c n2 , my tnh s tm tt c cc phn t.

57 58

Asort ( < mng > , [<n1>], [<n2>],[ <n3>]) Acopy ( mng ngun , mng ch , [<n1>], [<n2>],[ <n3>]) Alen (< mng >, n )

N3 = 1 : gim dn N3 = 0 : tng dn N 3 : c s th t Cho bit di ca mng N = 0 cho bit s phn t ca mng N = 1 cho bit s hng ca mng N = 2 cho bit s ct ca mng

59

Aelement ( < mng >, n1 , n2 ) 58 Asubscript ( < mng >, n1 , n2 ) 59

Tr v s th t ca phn t ca mng khi bit s hng n1 v s ct n2 Cho bit s hng hoc s ct khi bit s th t n1 Nu n2 = 1 th l hng N n2 = 2 th n l ct

60

Save to

Ct gi tr ca mng ln mt file

SSE., JSC.

8/8