Function worker

SimpleGraph/SimpleGraph.cpp:670–736

};

static void* worker(void* pArg)
{
	WorkerArg& arg = *static_cast<WorkerArg*>(pArg);
	unsigned countSeedTooShort = 0;
	unsigned countNoEdges = 0;
	unsigned countEdgesRemoved = 0;
	for (;;) {
		/** Lock the input stream. */
		static pthread_mutex_t inMutex = PTHREAD_MUTEX_INITIALIZER;
		pthread_mutex_lock(&inMutex);
		EstimateRecord er;
		bool good = bool((*arg.in) >> er);
		pthread_mutex_unlock(&inMutex);
		if (!good)
			break;
		if ((*arg.graph)[ContigNode(er.refID, false)].length < opt::minSeedLength) {
			++countSeedTooShort;
			continue;
		}

		// Remove edges with insufficient support.
		for (unsigned i = 0; i < 2; ++i) {
			Estimates& estimates = er.estimates[i];
			if (estimates.empty())
				continue;
			unsigned sizeBefore = estimates.size();
			estimates.erase(
				remove_if(estimates.begin(), estimates.end(), PoorSupport(opt::minEdgeWeight)),
				estimates.end());
			unsigned sizeAfter = estimates.size();
			unsigned edgesRemoved = sizeBefore - sizeAfter;
			countEdgesRemoved += edgesRemoved;
			if (sizeAfter == 0)
				++countNoEdges;
		}

		// Flip the anterior distance estimates.
		for (Estimates::iterator it = er.estimates[1].begin();
				it != er.estimates[1].end(); ++it)
			it->first ^= 1;

		ContigPath path;
		handleEstimate(*arg.graph, er, true, path);
		reverseComplement(path.begin(), path.end());
		path.push_back(ContigNode(er.refID, false));
		handleEstimate(*arg.graph, er, false, path);
		if (path.size() > 1) {
			/** Lock the output stream. */
			static pthread_mutex_t outMutex
				= PTHREAD_MUTEX_INITIALIZER;
			pthread_mutex_lock(&outMutex);
			*arg.out << get(g_contigNames, er.refID)
				<< '\t' << path << '\n';
			assert(arg.out->good());
			pthread_mutex_unlock(&outMutex);
		}
	}