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.

09382009-古志荣-homework02-LinkedQueue\LinkedQueue.cpp
......................................\LinkedQueue.h
......................................\main.cpp
09382009-古志荣-homework02-LinkedQueue

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．