while(m_queue.size()) {
			QueuedMinimapUpdate *q = m_queue.pop();
			std::map<v3s16, MinimapMapblock *>::iterator it;
			it = m_blocks_cache.find(q->p);
			if (q->data) {
				m_blocks_cache[q->p] = q->data;
			} else if (it != m_blocks_cache.end()) {
				if (it->second) {
					delete it->second;
				}
				m_blocks_cache.erase(it);
			}
		}