Impela, ake siqale.
Kulesi sihloko, sidingida inkinga evamile ebhekene nonjiniyela abasebenzisa ulimi lokuhlela lwe-C++: indlela yokugcwalisa amalungu afanayo ngoziro. Ungomunye waleyo misebenzi ebonakala iyisisekelo, nokho kubalulekile ukuqonda ukuthi uwenza kanjani ngendlela efanele ukuze ulondoloze ukusebenza kwekhodi okufanele. Ku-C++, kunezindlela ezimbalwa zokugcwalisa amalungu afanayo ngo-0, futhi sizohlaziya lezi zindlela ngokujulile ukuze siqonde imiphumela yazo ekwenzeni ikhodi yakho.
Ku-C++, amalungu afanayo ayizakhiwo zedatha ezihlanganisa izakhi zohlobo olufanayo, ezigcinwe ngokuhlanganyela enkumbulweni. Esinye sezici eziyinhloko zamalungu afanayo ku-C++ ukuthi anosayizi ogxilile. Lesi sici sosayizi ongashintshi ngokuvamile sibangela izimo lapho sidinga ukuqalisa noma ukugcwalisa amalungu afanayo ngevelu elithile, njengo-0.
Isixazululo Senkinga
#hlanganisa
#hlanganisa
int main () {
int arr[5];
std::fill_n(arr, 5, 0);
for(int i = 0; i<5; i++) {std::cout << arr[i] << ""; } buyisela 0; } [/code] Le khodi igcwalisa uhlu lwe-int ngoziro isebenzisa umsebenzi othi std::fill_n.
Incazelo yesinyathelo ngesinyathelo Yekhodi
Ekuqaleni, kumenyezelwa i-int array arr of size 5. Sibe sesisebenzisa umsebenzi we-std::fill_n ukuze sigcwalise uhlu ngoziro. Umsebenzi we-fill_n ungowe- umtapo we-algorithm efika ejwayelekile ne-C++. Isihloko se-algorithm sichaza imisebenzi ngezinjongo ezihlukahlukene (isb, ukusesha, ukuhlunga, ukukhohlisa) esingazisebenzisa kububanzi bezinto. Kulokhu, i-fill_n isetshenziselwa ukugcwalisa ububanzi bezinto ngevelu - kulokhu, uziro.
Umsebenzi we-fill_n uthatha ama-agumenti amathathu - eyokuqala ibe ikheli lokuqala lohlu, okwesibili kube usayizi wohlelo, futhi okwesithathu kube yinani okufanele uyigcwalise. Kulesi sihloko, sikutshela ukuthi kuqale ekuqaleni kwe-array, ukugcwalisa ama-elementi angu-5, futhi ukugcwalise ngoziro.
Umtapo Wezincwadi Ohilelekile: I-algorithm
Le labhulali ye-algorithm iyingxenye yomtapo wolwazi ojwayelekile we-C++ futhi isingatha isethi yemisebenzi esetshenziswa kakhulu ukwenza. imisebenzi kumalungu afanayo nezinye izakhiwo zedatha. Ukuba khona komtapo wolwazi onjalo kwenza imisebenzi eminingi yokufaka amakhodi ibe lula, kukhulula unjiniyela ekubhaleni imigqa eminingi yekhodi, ngaleyo ndlela enze ngcono ukusebenza kahle nokufunda.
Enye Indlela Yokugcwalisa I-Array ngo-Zero
Kukhona nezinye izindlela, njengokusebenzisa iluphu ukuze usethe i-elementi ngayinye kuqanda.
int main () {
int arr[5];
for(int i = 0; i<5; i++) {arr[i] = 0; } buyisela 0; } [/ikhodi] Kule ndlela yokwenza, sihlanganise ngokucacile phezu kwento ngayinye yamalungu afanayo futhi setha inani layo ku-0. Nakuba lide kancane, kulula ukuliqonda kwabaqalayo. Kodwa ngokusobala, indlela esebenzisa i-std::fill_n kanye nomtapo wezincwadi we-algorithm isebenza kahle kakhulu futhi iyakhethwa.
Umehluko Phakathi Kwezindlela Ezimbili
Nakuba umphumela ubonakala ufana, lezi zindlela ezimbili ziyahluka ekusetshenzisweni kwazo. Indlela yokuqala esebenzisa i-std::fill_n iyashesha futhi isebenza kahle kakhulu ngoba isebenzisa ama-algorithms akhethekile ukuze igcwalise uhlu ngo-0. Indlela yesibili iqondile futhi kulula ukuyiqonda, kodwa ihamba kancane njengoba yabela ngokwami inani elingu-0 engxenyeni ngayinye ye- uhlu.
Ngokuqonda izindlela ezihlukahlukene zokugcwalisa amalungu afanayo ngo-0 ku-C++, umuntu angakhuphula ukusebenza kahle kwekhodi nokufunda. Khumbula ukubaluleka kokusebenzisa imitapo yolwazi, njengoba ivumela ikhodi ehlanzekile futhi emfushane kakhudlwana, okuholela ekusebenzeni okungcono kakhulu sekukonke.