{"id":5066,"date":"2021-02-08T13:47:13","date_gmt":"2021-02-08T05:47:13","guid":{"rendered":"https:\/\/damogame.cn\/wordpress\/?p=5066"},"modified":"2021-02-08T13:47:13","modified_gmt":"2021-02-08T05:47:13","slug":"%e8%ae%be%e8%ae%a1%e4%b8%8d%e4%bd%bf%e7%94%a8%e4%ba%92%e6%96%a5%e9%94%81%e7%9a%84%e5%b9%b6%e5%8f%91%e6%95%b0%e6%8d%ae%e7%bb%93%e6%9e%84","status":"publish","type":"post","link":"https:\/\/i007.cc\/wordpress\/archives\/5066","title":{"rendered":"\u8bbe\u8ba1\u4e0d\u4f7f\u7528\u4e92\u65a5\u9501\u7684\u5e76\u53d1\u6570\u636e\u7ed3\u6784"},"content":{"rendered":"
\n
\n
\u539f\u6587\u5730\u5740<\/a><\/div>\n<\/div>\n
<\/div>\n<\/div>\n

\u7b80\u4ecb<\/h2>\n

\u672c\u6587\u662f\u672c\u7cfb\u5217\u7684\u6700\u540e\u4e00\u7bc7\uff0c\u8ba8\u8bba\u4e24\u4e2a\u4e3b\u9898\uff1a\u5173\u4e8e\u5b9e\u73b0\u57fa\u4e8e\u4e92\u65a5\u9501\u7684\u5e76\u53d1\u94fe\u8868\u7684\u8bbe\u8ba1\u65b9\u6cd5\u548c\u8bbe\u8ba1\u4e0d\u4f7f\u7528\u4e92\u65a5\u9501\u7684\u5e76\u53d1\u6570\u636e\u7ed3\u6784\u3002\u5bf9\u4e8e\u540e\u4e00\u4e2a\u4e3b\u9898\uff0c\u6211\u9009\u62e9\u5b9e\u73b0\u4e00\u4e2a\u5e76\u53d1\u5806\u6808\u5e76\u89e3\u91ca\u8bbe\u8ba1\u8fd9\u79cd\u6570\u636e\u7ed3\u6784\u6d89\u53ca\u7684\u4e00\u4e9b\u95ee\u9898\u3002\u7528\u00a0C++<\/code>\u00a0\u8bbe\u8ba1\u72ec\u7acb\u4e8e\u5e73\u53f0\u7684\u4e0d\u4f7f\u7528\u4e92\u65a5\u9501\u7684\u6570\u636e\u7ed3\u6784\u76ee\u524d\u8fd8\u4e0d\u53ef\u884c\uff0c\u6240\u4ee5\u6211\u9009\u7528 GCC version 4.3.4 \u4f5c\u4e3a\u7f16\u8bd1\u5668\u5e76\u5728\u4ee3\u7801\u4e2d\u4f7f\u7528 GCC \u7279\u6709\u7684\u00a0__sync_*<\/code>\u00a0\u51fd\u6570\u3002\u5982\u679c\u60a8\u662f WIndows\u00ae\u00a0C++<\/code>\u00a0\u5f00\u53d1\u4eba\u5458\uff0c\u53ef\u4ee5\u8003\u8651\u4f7f\u7528 Interlocked* \u7cfb\u5217\u51fd\u6570\u5b9e\u73b0\u76f8\u4f3c\u7684\u529f\u80fd\u3002<\/p>\n

\u5e76\u53d1\u5355\u5411\u94fe\u8868\u7684\u8bbe\u8ba1\u65b9\u6cd5<\/h2>\n

\u6e05\u5355 1<\/a>\u00a0\u7ed9\u51fa\u6700\u57fa\u672c\u7684\u5e76\u53d1\u5355\u5411\u94fe\u8868\u63a5\u53e3\u3002\u662f\u4e0d\u662f\u7f3a\u5c11\u4ec0\u4e48\u4e1c\u897f\uff1f<\/p>\n

\u6e05\u5355 1. \u5e76\u53d1\u5355\u5411\u94fe\u8868\u63a5\u53e3<\/h5>\n
\n
\n
\n\n\n\n
\n
1<\/div>\n
2<\/div>\n
3<\/div>\n
4<\/div>\n
5<\/div>\n
6<\/div>\n
7<\/div>\n
8<\/div>\n
9<\/div>\n
10<\/div>\n
11<\/div>\n
12<\/div>\n
13<\/div>\n
14<\/div>\n
15<\/div>\n
16<\/div>\n
17<\/div>\n
18<\/div>\n<\/td>\n
\n
\n
template <<\/code>typename<\/code> T><\/code><\/div>\n
class SList { <\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>private: <\/code><\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/code>typedef struct Node { <\/code><\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/code>T data;<\/code><\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/code>Node *next;<\/code><\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/code>Node(T& data) : value(data), next(NULL) { }<\/code><\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/code>} Node; <\/code><\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/code>pthread_mutex_t _lock;<\/code><\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/code>Node *head, *tail;\u00a0 <\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>public: <\/code><\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/code>void push_back(T& value);<\/code><\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/code>void insert_after(T& previous, T& value); \/\/ insert data after previous<\/code><\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/code>void remove(const T& value);<\/code><\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/code>bool find(const T& value);\u00a0 \/\/ return true on success <\/code><\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/code>SList(\u00a0 );<\/code><\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/code>~SList(\u00a0 ); <\/code><\/div>\n
};<\/code><\/div>\n<\/div>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/div>\n<\/div>\n<\/div>\n

\u6e05\u5355 2<\/a>\u00a0\u7ed9\u51fa\u00a0push_back<\/code>\u00a0\u65b9\u6cd5\u5b9a\u4e49\u3002<\/p>\n

\u6e05\u5355 2. \u628a\u6570\u636e\u6dfb\u52a0\u5230\u5e76\u53d1\u94fe\u8868\u4e2d<\/h5>\n
\n
\n
\n\n\n\n
\n
1<\/div>\n
2<\/div>\n
3<\/div>\n
4<\/div>\n
5<\/div>\n
6<\/div>\n
7<\/div>\n
8<\/div>\n
9<\/div>\n
10<\/div>\n
11<\/div>\n
12<\/div>\n<\/td>\n
\n
\n
void SList<<\/code>T<\/code>>::push_back(T& data)<\/code><\/div>\n
{ <\/code><\/div>\n
\u00a0\u00a0\u00a0\u00a0<\/code>pthread_mutex_lock(&_lock);<\/code><\/div>\n
\u00a0\u00a0\u00a0\u00a0<\/code>if (head == NULL) { <\/code><\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/code>head = new Node(data);<\/code><\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/code>tail = head;<\/code><\/div>\n
\u00a0\u00a0\u00a0\u00a0<\/code>} else { <\/code><\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/code>tail->next = new Node(data);<\/code><\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/code>tail = tail->next;<\/code><\/div>\n
\u00a0\u00a0\u00a0\u00a0<\/code>}<\/code><\/div>\n
\u00a0\u00a0\u00a0\u00a0<\/code>pthread_mutex_unlock(&_lock);<\/code><\/div>\n
}<\/code><\/div>\n<\/div>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/div>\n<\/div>\n<\/div>\n

\u73b0\u5728\uff0c\u5047\u8bbe\u4e00\u4e2a\u7ebf\u7a0b\u8bd5\u56fe\u901a\u8fc7\u8c03\u7528\u00a0push_back<\/code>\u00a0\u628a\u00a0n<\/em>\u00a0\u4e2a\u6574\u6570\u8fde\u7eed\u5730\u6dfb\u52a0\u5230\u8fd9\u4e2a\u94fe\u8868\u4e2d\u3002\u8fd9\u4e2a\u63a5\u53e3\u672c\u8eab\u8981\u6c42\u83b7\u53d6\u5e76\u91ca\u653e\u4e92\u65a5\u9501\u00a0n<\/em>\u00a0\u6b21\uff0c\u5373\u4f7f\u5728\u7b2c\u4e00\u6b21\u83b7\u53d6\u9501\u4e4b\u524d\u5df2\u7ecf\u77e5\u9053\u8981\u63d2\u5165\u7684\u6240\u6709\u6570\u636e\u3002\u66f4\u597d\u7684\u505a\u6cd5\u662f\u5b9a\u4e49\u53e6\u4e00\u4e2a\u65b9\u6cd5\uff0c\u5b83\u63a5\u6536\u4e00\u7cfb\u5217\u6574\u6570\uff0c\u53ea\u83b7\u53d6\u5e76\u91ca\u653e\u4e92\u65a5\u9501\u4e00\u6b21\u3002\u6e05\u5355 3<\/a>\u00a0\u7ed9\u51fa\u65b9\u6cd5\u5b9a\u4e49\u3002<\/p>\n

\u6e05\u5355 3. \u5728\u94fe\u8868\u4e2d\u63d2\u5165\u6570\u636e\u7684\u66f4\u597d\u65b9\u6cd5<\/h5>\n
\n
\n
\n\n\n\n
\n
1<\/div>\n
2<\/div>\n
3<\/div>\n
4<\/div>\n
5<\/div>\n
6<\/div>\n
7<\/div>\n
8<\/div>\n
9<\/div>\n
10<\/div>\n
11<\/div>\n
12<\/div>\n
13<\/div>\n
14<\/div>\n
15<\/div>\n
16<\/div>\n
17<\/div>\n
18<\/div>\n
19<\/div>\n<\/td>\n
\n
\n
void SList<<\/code>T<\/code>>::push_back(T* data, int count) \/\/ or use C++ iterators <\/code><\/div>\n
{ <\/code><\/div>\n
\u00a0\u00a0\u00a0\u00a0<\/code>Node *begin = new Node(data[0]);<\/code><\/div>\n
\u00a0\u00a0\u00a0\u00a0<\/code>Node *temp = begin;<\/code><\/div>\n
\u00a0\u00a0\u00a0\u00a0<\/code>for (int i=1; i<<\/code>count<\/code>; ++i) {<\/code><\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/code>temp->next = new Node(data[i]);<\/code><\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/code>temp = temp->next;<\/code><\/div>\n
\u00a0\u00a0\u00a0\u00a0<\/code>}<\/code><\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/code><\/div>\n
\u00a0\u00a0\u00a0\u00a0<\/code>pthread_mutex_lock(&_lock);<\/code><\/div>\n
\u00a0\u00a0\u00a0\u00a0<\/code>if (head == NULL) { <\/code><\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/code>head = begin;<\/code><\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/code>tail = head;<\/code><\/div>\n
\u00a0\u00a0\u00a0\u00a0<\/code>} else { <\/code><\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/code>tail->next = begin;<\/code><\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/code>tail = temp;<\/code><\/div>\n
\u00a0\u00a0\u00a0\u00a0<\/code>}<\/code><\/div>\n
\u00a0\u00a0\u00a0\u00a0<\/code>pthread_mutex_unlock(&_lock);<\/code><\/div>\n
}<\/code><\/div>\n<\/div>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/div>\n<\/div>\n<\/div>\n

\u4f18\u5316\u641c\u7d22\u5143\u7d20<\/h3>\n

\u73b0\u5728\uff0c\u6211\u4eec\u6765\u4f18\u5316\u94fe\u8868\u4e2d\u7684\u641c\u7d22\u5143\u7d20 \u2014 \u5373\u00a0find<\/code>\u00a0\u65b9\u6cd5\u3002\u4e0b\u9762\u662f\u51e0\u79cd\u53ef\u80fd\u51fa\u73b0\u7684\u60c5\u51b5\uff1a<\/p>\n