文件名称:homework02-LinkedQueue
介绍说明－－下载内容均来自于网络，请自行研究使用
ConcurrentLinkedQueue是Queue的一个线程安全实现。
它是一个基于链接节点的*线程安全队列。此队列按照 FIFO（先进先出）原则对元素进行排序。队列的头部 是队列中时间最长的元素。
队列的尾部 是队列中时间最短的元素。新的元素插入到队列的尾部，队列获取操作从队列头部获得元素。
当多个线程共享访问一个公共 collection 时，ConcurrentLinkedQueue 是一个恰当的选择。此队列不允许使用 null 元素。
-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.
它是一个基于链接节点的*线程安全队列。此队列按照 FIFO（先进先出）原则对元素进行排序。队列的头部 是队列中时间最长的元素。
队列的尾部 是队列中时间最短的元素。新的元素插入到队列的尾部，队列获取操作从队列头部获得元素。
当多个线程共享访问一个公共 collection 时，ConcurrentLinkedQueue 是一个恰当的选择。此队列不允许使用 null 元素。
-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