04 2022 档案
摘要://Util.h #ifndef Util_H #define Util_H #include <chrono> #include <ctime> #include <fstream> #include <functional> #include <iostream> #include <threa
阅读全文
摘要://Util.h static unsigned long long factorialLoops; long double Fibonacci35(int len); //Util.cpp unsigned long long Util::factorialLoops=0; long double
阅读全文
摘要:#include <iostream> #include <limits.h> void Util::showMax(){ cout<<fixed<<"INT32_MAX="<<INT32_MAX<<endl; cout<<fixed<<"UINT32_MAX="<<UINT32_MAX<<endl
阅读全文
摘要:The common or classic Fibonacci algorithm //Util.h static unsigned long long factorialLoops; long double Fibonacci35(int len); //Util.cpp unsigned lon
阅读全文
摘要:void Util::thread14(int x,int y,string str) { thread t1([](int xx,int yy,string sstr) { Util ul; for(int i=0;i<xx;i++) { cout<<"Num= "<<i<<","<<ul.get
阅读全文
摘要:#include "Model/Util.h" char *Util::uuidValue = (char *)malloc(40); void Util::threadLambda6(int xx,int yy,string sstr) { thread t1([](int x,int y,str
阅读全文
摘要:void thread28(int num,string sstr) { thread t([](int x,string str) { printNumUuid26(); printUuidNum27(); printUuid30(x); printUuid31(str); },num,sstr)
阅读全文
摘要:void printArray17(int *arr, int len) { for (int i = 0; i < len; i++) { cout << arr[i] << "\t"; } cout << endl << endl; } void getArray16(int *arr, int
阅读全文