/* ABOUT this program ouputs prime factors of a pool of integers using threads. */ #include #include #include #include #include #include #define workersNum 20 using namespace std; mutex pool_mtx; mutex cout_mtx; //following tprintf recursive variadic functions taken from example at address https://en.cppreference.com/w/cpp/language/parameter_pack and slightly modified void tprintf(const char* format){ cout << format; } template void tprintf(const char* format, T value, Targs... next){ while(*format!='\0'){ if(*format =='%'){ cout << value; tprintf(format+1, next...); return; } cout << *format; format++; } } void work(queue * pool){ ////////////////////////////// thread::id threadId=this_thread::get_id(); int popped,num,divisor; //////////////////////// cout_mtx.lock(); tprintf("threadId % started\n\n", threadId ); cout_mtx.unlock(); ////////////////////// while(pool->size()>0){ ////////////////////// pool_mtx.lock(); popped=pool->front(); pool->pop(); pool_mtx.unlock(); ////////////////////// num=popped; divisor=2; string factorsStr=""; ////////////////////// this_thread::sleep_for(chrono::milliseconds(1));//just to give a chance for all threads to work on sololearn while(divisor pool; for(int i=0;i<50;i++) pool.push(rand()); ///////////////////////// thread workers[workersNum]; for(int i=0;i

variadic thread get id queue pool mutex sleep