Description: ConcurrentLinkedQueue is a thread-safe Queue achieve. It is an unbounded thread-safe queue based on linked nodes. This queue elements are sorted according to the FIFO (first-in, first-out) principle. The head of the queue is the element of the queue the longest time. The tail of the queue is the shortest queue elements. The new element is inserted into the end of the queue, the queue retrieval operations obtain elements at the head of the queue. When multiple threads share access to a public collection, ConcurrentLinkedQueue is an appropriate choice. This queue does not permit null elements.
To Search:
File list (Check if you may need any files):
09382009-古志荣-homework02-LinkedQueue\LinkedQueue.cpp
......................................\LinkedQueue.h
......................................\main.cpp
09382009-古志荣-homework02-LinkedQueue
Download