{"id":40619,"date":"2025-05-29T21:46:35","date_gmt":"2025-05-29T13:46:35","guid":{"rendered":"https:\/\/www.wsisp.com\/helps\/40619.html"},"modified":"2025-05-29T21:46:35","modified_gmt":"2025-05-29T13:46:35","slug":"%e7%ae%80%e5%8d%95%e7%9a%84%e5%9f%ba%e4%ba%8esqlite%e7%9a%84%e6%9c%8d%e5%8a%a1%e5%99%a8%e5%92%8c%e5%ae%a2%e6%88%b7%e7%ab%af%e5%ae%9e%e7%8e%b0","status":"publish","type":"post","link":"https:\/\/www.wsisp.com\/helps\/40619.html","title":{"rendered":"\u7b80\u5355\u7684\u57fa\u4e8esqlite\u7684\u670d\u52a1\u5668\u548c\u5ba2\u6237\u7aef\u5b9e\u73b0"},"content":{"rendered":"

server.c<\/p>\n

#<\/span>include<\/span> <stdio.h><\/span><\/span>
\n#<\/span>include<\/span> <string.h><\/span><\/span>
\n#<\/span>include<\/span> <unistd.h><\/span><\/span>
\n#<\/span>include<\/span> <stdlib.h><\/span><\/span>
\n#<\/span>include<\/span> <sys\/types.h><\/span><\/span>
\n#<\/span>include<\/span> <sys\/stat.h><\/span><\/span>
\n#<\/span>include<\/span> <fcntl.h><\/span><\/span>
\n#<\/span>include<\/span> <pthread.h><\/span><\/span>
\n#<\/span>include<\/span> <semaphore.h><\/span><\/span>
\n#<\/span>include<\/span> <wait.h><\/span><\/span>
\n#<\/span>include<\/span> <signal.h><\/span><\/span>
\n#<\/span>include<\/span> <sys\/socket.h><\/span><\/span>
\n#<\/span>include<\/span> <arpa\/inet.h><\/span><\/span>
\n#<\/span>include<\/span> <sys\/ipc.h><\/span><\/span>
\n#<\/span>include<\/span> <sys\/sem.h><\/span><\/span>
\n#<\/span>include<\/span> <semaphore.h><\/span><\/span>
\n#<\/span>include<\/span> <sys\/msg.h><\/span><\/span>
\n#<\/span>include<\/span> <sys\/shm.h><\/span><\/span>
\n#<\/span>include<\/span> <sys\/un.h><\/span><\/span>
\n#<\/span>include<\/span> <sys\/time.h><\/span><\/span>
\n#<\/span>include<\/span> <sys\/select.h><\/span><\/span>
\n#<\/span>include<\/span> <sys\/epoll.h><\/span><\/span>
\n#<\/span>include<\/span> "doublyList.h"<\/span><\/span>
\n#<\/span>include<\/span> <sqlite3.h><\/span><\/span>
\n#<\/span>include<\/span> "array.h"<\/span><\/span>
\nmyListOP *<\/span> fdList;<\/span><\/p>\n

int<\/span> isSameAddr<\/span>(<\/span>void<\/span>*<\/span> a,<\/span>void<\/span>*<\/span>b)<\/span>{<\/span>
\n return<\/span> a–<\/span>b;<\/span>
\n}<\/span>
\nint<\/span> isSameInt<\/span>(<\/span>int<\/span>*<\/span> a,<\/span>int<\/span>*<\/span>b)<\/span>{<\/span>
\n return<\/span> *<\/span>a–<\/span>*<\/span>b;<\/span>
\n}<\/span><\/p>\n

struct<\/span> info<\/span>{<\/span>
\n struct<\/span> sockaddr_in<\/span> client_addr;<\/span>
\n int<\/span> fd;<\/span>
\n struct<\/span> epoll_event<\/span>*<\/span> event;<\/span>
\n myListOP*<\/span> record;<\/span>
\n}<\/span>;<\/span><\/p>\n

int<\/span>*<\/span> getfd<\/span>(<\/span>struct<\/span> info<\/span>*<\/span> info)<\/span>{<\/span>
\n return<\/span> &<\/span>(<\/span>info-><\/span>event-><\/span>data.<\/span>fd)<\/span>;<\/span>
\n}<\/span><\/p>\n

struct<\/span> patientRecord<\/span>
\n{<\/span>
\n time_t<\/span> time;<\/span>
\n char<\/span> patientName[<\/span>40<\/span>]<\/span>;<\/span>
\n char<\/span> patientRec[<\/span>128<\/span>]<\/span>;<\/span>
\n char<\/span> doctorDia[<\/span>128<\/span>]<\/span>;<\/span>
\n char<\/span> tablet[<\/span>128<\/span>]<\/span>;<\/span>
\n char<\/span> doctorAdv[<\/span>128<\/span>]<\/span>;<\/span>
\n \/\/size=4*128+4+40=556<\/span>
\n}<\/span>;<\/span>
\nstruct<\/span> patientRecord<\/span> *<\/span> createPatinetRecord<\/span>(<\/span>time_t<\/span> time,<\/span>char<\/span>*<\/span> patientName,<\/span>\\\\
\n char<\/span>*<\/span> patientRec,<\/span>char<\/span>*<\/span> doctorDia,<\/span>char<\/span>*<\/span> tablet,<\/span>char<\/span>*<\/span> doctorAdv)<\/span>{<\/span>
\n struct<\/span> patientRecord<\/span> *<\/span> ret =<\/span> malloc<\/span> (<\/span>sizeof<\/span> (<\/span>struct<\/span> patientRecord<\/span>)<\/span>)<\/span>;<\/span>
\n ret-><\/span>time =<\/span> time;<\/span>
\n if<\/span> (<\/span>patientName)<\/span>
\n {<\/span>
\n strcpy<\/span>(<\/span>ret-><\/span>patientName,<\/span>patientName)<\/span>;<\/span>
\n }<\/span>
\n strcpy<\/span>(<\/span>ret-><\/span>patientRec,<\/span>patientRec)<\/span>;<\/span>
\n strcpy<\/span>(<\/span>ret-><\/span>doctorDia,<\/span>doctorDia)<\/span>;<\/span>
\n strcpy<\/span>(<\/span>ret-><\/span>tablet,<\/span>tablet)<\/span>;<\/span>
\n strcpy<\/span>(<\/span>ret-><\/span>doctorAdv,<\/span>doctorAdv)<\/span>;<\/span>
\n return<\/span> ret;<\/span>
\n }<\/span>
\nenum<\/span> enum_send_t<\/span>{<\/span>
\n send_record =<\/span>1<\/span>,<\/span>
\n read_record,<\/span>
\n}<\/span>;<\/span>
\nstruct<\/span> send_t<\/span>
\n{<\/span>
\n enum<\/span> enum_send_t<\/span> type;<\/span>
\n struct<\/span> patientRecord<\/span> patientRecord;<\/span>
\n}<\/span>;<\/span>
\nstatic<\/span> void<\/span> printRec<\/span>(<\/span>struct<\/span> patientRecord<\/span>*<\/span> rec)<\/span>{<\/span>
\n char<\/span> timeStr[<\/span>64<\/span>]<\/span>;<\/span> \/\/ \u7528\u4e8e\u5b58\u50a8\u683c\u5f0f\u5316\u540e\u7684\u65f6\u95f4\u5b57\u7b26\u4e32<\/span>
\n strftime<\/span>(<\/span>timeStr,<\/span> sizeof<\/span>(<\/span>timeStr)<\/span>,<\/span> "%Y-%m-%d %H:%M:%S"<\/span>,<\/span> localtime<\/span>(<\/span>&<\/span>rec-><\/span>time)<\/span>)<\/span>;<\/span>
\n printf<\/span>(<\/span>"%s::\\\\n \u75c5\u4eba\u63cf\u8ff0:%s\\\\n, \u533b\u751f\u8bca\u65ad:%s\\\\n, \u5f00\u836f:%s\\\\n, \u533b\u5631:%s\\\\n"<\/span>,<\/span>
\n timeStr,<\/span> rec-><\/span>patientRec,<\/span> rec-><\/span>doctorDia,<\/span> rec-><\/span>tablet,<\/span> rec-><\/span>doctorAdv)<\/span>;<\/span>
\n}<\/span>
\nstatic<\/span> void<\/span> printSend_t<\/span>(<\/span>struct<\/span> send_t<\/span>*<\/span> send)<\/span>{<\/span>
\n if<\/span> (<\/span>send-><\/span>type ==<\/span> send_record)<\/span>
\n {<\/span>
\n printf<\/span>(<\/span>"send_record\\\\n"<\/span>)<\/span>;<\/span>
\n }<\/span>
\n if<\/span> (<\/span>send-><\/span>type ==<\/span> read_record)<\/span>
\n {<\/span>
\n printf<\/span>(<\/span>"read_record\\\\n"<\/span>)<\/span>;<\/span>
\n }<\/span><\/p>\n

printRec<\/span>(<\/span>&<\/span>send-><\/span>patientRecord)<\/span>;<\/span>
\n}<\/span><\/p>\n

struct<\/span> info<\/span>*<\/span> creatInfo<\/span>(<\/span>struct<\/span> sockaddr_in<\/span> *<\/span>client_addr,<\/span>int<\/span> fd,<\/span>struct<\/span> epoll_event<\/span>*<\/span> event)<\/span>{<\/span>
\n struct<\/span> info<\/span>*<\/span> ret =<\/span> malloc<\/span>(<\/span>sizeof<\/span>(<\/span>struct<\/span> info<\/span>)<\/span>)<\/span>;<\/span>
\n ret-><\/span>record =<\/span> myListDInit<\/span>(<\/span>printSend_t<\/span>)<\/span>;<\/span>
\n if<\/span> (<\/span>client_addr)<\/span>
\n {<\/span>
\n ret-><\/span>client_addr=<\/span>*<\/span>client_addr;<\/span>
\n }<\/span>
\n else<\/span>{<\/span>
\n memset<\/span>(<\/span>&<\/span>ret-><\/span>client_addr,<\/span>0<\/span>,<\/span>sizeof<\/span>(<\/span>struct<\/span> sockaddr_in<\/span>)<\/span>)<\/span>;<\/span>
\n }<\/span>
\n ret-><\/span>event =<\/span> event;<\/span>
\n ret-><\/span>fd =<\/span> fd;<\/span>
\n return<\/span> ret;<\/span>
\n}<\/span>
\nvoid<\/span> printInfo<\/span>(<\/span>struct<\/span> info<\/span>*<\/span> info)<\/span>{<\/span>
\n static<\/span> char<\/span> ip_human[<\/span>16<\/span>]<\/span> =<\/span> {<\/span>0<\/span>}<\/span>;<\/span>
\n if<\/span> (<\/span>info ==<\/span>0<\/span> ||<\/span> (<\/span>&<\/span>(<\/span>info-><\/span>client_addr)<\/span>==<\/span>0<\/span>)<\/span>)<\/span>
\n {<\/span>
\n return<\/span>;<\/span>
\n }<\/span><\/p>\n

int<\/span> port_human=<\/span>ntohs<\/span>(<\/span>info-><\/span>client_addr.<\/span>sin_port)<\/span>;<\/span>
\n inet_ntop<\/span>(<\/span>AF_INET,<\/span>&<\/span>info-><\/span>client_addr.<\/span>sin_addr,<\/span>ip_human,<\/span>16<\/span>)<\/span>;<\/span>
\n printf<\/span>(<\/span>"ip:%s,port:%d,fd:%d::"<\/span>,<\/span>ip_human,<\/span>port_human,<\/span>info-><\/span>fd)<\/span>;<\/span>
\n}<\/span><\/p>\n

sqlite3*<\/span> db;<\/span><\/p>\n

int<\/span> mysqlite3_append<\/span>(<\/span>struct<\/span> patientRecord<\/span>*<\/span> rec)<\/span>{<\/span>
\n char<\/span> sql[<\/span>1024<\/span>]<\/span>=<\/span>""<\/span>;<\/span>
\n sprintf<\/span>(<\/span>sql,<\/span>"create table if not exists %s (\\\\
\n \u65e5\u671f INTEGER ,\\\\
\n \u75c5\u4eba\u53e3\u8ff0 TEXT,\\\\
\n \u533b\u751f\u8bca\u65ad TEXT,\\\\
\n \u533b\u751f\u5f00\u836f TEXT,\\\\
\n \u533b\u5631 text \\\\
\n );"<\/span>,<\/span> rec-><\/span>patientName)<\/span>;<\/span>
\n char<\/span> *<\/span>*<\/span> result;<\/span>
\n char<\/span> *<\/span> errmsg;<\/span>
\n int<\/span> ret =<\/span> 0<\/span>;<\/span>
\n ret=<\/span>sqlite3_exec<\/span>(<\/span>db,<\/span>sql,<\/span>0<\/span>,<\/span>0<\/span>,<\/span>&<\/span>errmsg)<\/span>;<\/span>
\n if<\/span> (<\/span>ret)<\/span>
\n {<\/span>
\n \/\/sql\u6267\u884c\u4e00\u573a<\/span>
\n printf<\/span>(<\/span>"\u5728\u6dfb\u52a0\u8868\u683c\u65f6\u51fa\u73b0\u5f02\u5e38:: %s\\\\n"<\/span>,<\/span>errmsg)<\/span>;<\/span>
\n return<\/span> EXIT_FAILURE;<\/span>
\n }<\/span>
\n sprintf<\/span>(<\/span>sql,<\/span>"insert into %s (\u65e5\u671f,\u75c5\u4eba\u53e3\u8ff0,\u533b\u751f\u8bca\u65ad,\u533b\u751f\u5f00\u836f,\u533b\u5631)\\\\
\n values (%ld,'%s','%s','%s','%s');"<\/span>,<\/span>\\\\
\n rec-><\/span>patientName,<\/span>rec-><\/span>time,<\/span>rec-><\/span>patientRec,<\/span>rec-><\/span>doctorDia,<\/span>rec-><\/span>tablet,<\/span>rec-><\/span>doctorAdv)<\/span>;<\/span>
\n ret=<\/span>sqlite3_exec<\/span>(<\/span>db,<\/span>sql,<\/span>0<\/span>,<\/span>0<\/span>,<\/span>&<\/span>errmsg)<\/span>;<\/span>
\n if<\/span> (<\/span>ret)<\/span>
\n {<\/span>
\n \/\/sql\u6267\u884c\u4e00\u573a<\/span>
\n printf<\/span>(<\/span>"\u5728\u6dfb\u52a0\u6570\u636e\u65f6\u51fa\u73b0\u5f02\u5e38:: %s\\\\n"<\/span>,<\/span>errmsg)<\/span>;<\/span>
\n return<\/span> EXIT_FAILURE;<\/span>
\n }<\/span>
\n return<\/span> 0<\/span>;<\/span>
\n}<\/span>
\nint<\/span> callback<\/span> (<\/span>myListOP*<\/span> list,<\/span>int<\/span> argc,<\/span> char<\/span> *<\/span>*<\/span> argv,<\/span>char<\/span>*<\/span>*<\/span> col)<\/span>{<\/span>
\n \/\/ for (int i = 0; i < argc; i++)<\/span>
\n \/\/ {<\/span>
\n \/\/ \/* code *\/<\/span>
\n \/\/ }<\/span><\/p>\n

list-><\/span>append<\/span>(<\/span>list,<\/span>createPatinetRecord<\/span>(<\/span>atol<\/span>(<\/span>argv[<\/span>0<\/span>]<\/span>)<\/span>,<\/span>0<\/span>,<\/span>argv[<\/span>1<\/span>]<\/span>,<\/span>\\\\
\n argv[<\/span>2<\/span>]<\/span>,<\/span>argv[<\/span>3<\/span>]<\/span>,<\/span>argv[<\/span>4<\/span>]<\/span>)<\/span>)<\/span>;<\/span>
\n return<\/span> 0<\/span>;<\/span><\/p>\n

}<\/span>
\nint<\/span> mysqlite3_read<\/span>(<\/span>struct<\/span> patientRecord<\/span> *<\/span> rec,<\/span>myListOP*<\/span> list)<\/span>{<\/span>
\n char<\/span> sql[<\/span>1024<\/span>]<\/span>=<\/span>""<\/span>;<\/span><\/p>\n

sprintf<\/span>(<\/span>sql,<\/span>"create table if not exists %s (\\\\
\n \u65e5\u671f INTEGER ,\\\\
\n \u75c5\u4eba\u53e3\u8ff0 TEXT,\\\\
\n \u533b\u751f\u8bca\u65ad TEXT,\\\\
\n \u533b\u751f\u5f00\u836f TEXT,\\\\
\n \u533b\u5631 text \\\\
\n );"<\/span>,<\/span> rec-><\/span>patientName)<\/span>;<\/span>
\n char<\/span> *<\/span>*<\/span> result;<\/span>
\n char<\/span> *<\/span> errmsg;<\/span>
\n int<\/span> ret =<\/span> 0<\/span>;<\/span>
\n ret=<\/span>sqlite3_exec<\/span>(<\/span>db,<\/span>sql,<\/span>0<\/span>,<\/span>0<\/span>,<\/span>&<\/span>errmsg)<\/span>;<\/span>
\n if<\/span> (<\/span>ret)<\/span>
\n {<\/span>
\n \/\/sql\u6267\u884c\u4e00\u573a<\/span>
\n printf<\/span>(<\/span>"\u5728\u6dfb\u52a0\u8868\u683c\u65f6\u51fa\u73b0\u5f02\u5e38:: %s\\\\n"<\/span>,<\/span>errmsg)<\/span>;<\/span>
\n return<\/span> EXIT_FAILURE;<\/span>
\n }<\/span>
\n sprintf<\/span>(<\/span>sql,<\/span>"select * from %s ;"<\/span>,<\/span> rec-><\/span>patientName)<\/span>;<\/span>
\n ret=<\/span>sqlite3_exec<\/span>(<\/span>db,<\/span>sql,<\/span>callback,<\/span>list,<\/span>&<\/span>errmsg)<\/span>;<\/span>
\n if<\/span> (<\/span>ret)<\/span>
\n {<\/span>
\n \/\/sql\u6267\u884c\u4e00\u573a<\/span>
\n printf<\/span>(<\/span>"\u5728\u6dfb\u52a0\u6570\u636e\u65f6\u51fa\u73b0\u5f02\u5e38:: %s\\\\n"<\/span>,<\/span>errmsg)<\/span>;<\/span>
\n return<\/span> EXIT_FAILURE;<\/span>
\n }<\/span>
\n return<\/span> 0<\/span>;<\/span>
\n}<\/span>
\nint<\/span> serverfun<\/span>(<\/span>struct<\/span> info<\/span>*<\/span> info)<\/span>{<\/span>
\n int<\/span> client =<\/span> info-><\/span>fd;<\/span>
\n char<\/span> ip_human[<\/span>16<\/span>]<\/span>=<\/span>{<\/span>0<\/span>}<\/span>;<\/span>
\n int<\/span> port_human=<\/span>0<\/span>;<\/span>
\n struct<\/span> sockaddr_in<\/span> client_addr =<\/span> {<\/span>0<\/span>}<\/span>;<\/span>
\n client_addr =<\/span> info-><\/span>client_addr;<\/span>
\n inet_ntop<\/span>(<\/span>AF_INET,<\/span>&<\/span>client_addr.<\/span>sin_addr,<\/span>ip_human,<\/span>16<\/span>)<\/span>;<\/span>
\n port_human=<\/span>ntohs<\/span>(<\/span>client_addr.<\/span>sin_port)<\/span>;<\/span>
\n char<\/span> buf[<\/span>560<\/span>]<\/span> =<\/span> ""<\/span>;<\/span>
\n int<\/span> res =<\/span> read<\/span>(<\/span>client,<\/span>buf,<\/span>sizeof<\/span>(<\/span>unsigned<\/span> short<\/span> int<\/span>)<\/span>)<\/span>;<\/span>
\n int<\/span> size =<\/span> *<\/span>(<\/span>unsigned<\/span> short<\/span> int<\/span>*<\/span>)<\/span>buf;<\/span>
\n if<\/span> (<\/span>res ==<\/span> 0<\/span>)<\/span>
\n {<\/span>
\n printf<\/span>(<\/span>"\u5ba2\u6237\u7aef\u5df2\u65ad\u5f00\u8fde\u63a5:\\\\nIP:%s\\\\nport:%d\\\\n"<\/span>,<\/span>ip_human,<\/span>port_human)<\/span>;<\/span>
\n close<\/span>(<\/span>client)<\/span>;<\/span>
\n fdList-><\/span>del<\/span>(<\/span>fdList,<\/span>fdList-><\/span>find<\/span>(<\/span>fdList,<\/span>info,<\/span>0<\/span>)<\/span>)<\/span>;<\/span>
\n return<\/span> 0<\/span>;<\/span>
\n }<\/span>
\n res =<\/span> read<\/span>(<\/span>client,<\/span>buf+<\/span>sizeof<\/span>(<\/span>unsigned<\/span> short<\/span> int<\/span>)<\/span>,<\/span>size–<\/span>sizeof<\/span>(<\/span>unsigned<\/span> short<\/span> int<\/span>)<\/span>)<\/span>;<\/span>
\n myListOP *<\/span> tmp =<\/span>0<\/span>;<\/span>
\n tmp =<\/span> info-><\/span>record-><\/span>unpack<\/span>(<\/span>info-><\/span>record,<\/span>buf,<\/span>printRec)<\/span>;<\/span>
\n info-><\/span>record-><\/span>destory<\/span>(<\/span>info-><\/span>record)<\/span>;<\/span>
\n info-><\/span>record=<\/span>tmp;<\/span>
\n struct<\/span> send_t<\/span> *<\/span> st =<\/span> 0<\/span>;<\/span>
\n unsigned<\/span> int<\/span> i=<\/span>0<\/span>;<\/span>
\n while<\/span> (<\/span>st =<\/span> info-><\/span>record-><\/span>slice<\/span>(<\/span>info-><\/span>record,<\/span>i++<\/span>)<\/span>)<\/span>
\n {<\/span>
\n if<\/span> (<\/span>st-><\/span>type ==<\/span> send_record)<\/span>
\n {<\/span>
\n mysqlite3_append<\/span>(<\/span>&<\/span>st-><\/span>patientRecord)<\/span>;<\/span>
\n }<\/span>
\n if<\/span> (<\/span>st-><\/span>type ==<\/span> read_record)<\/span>
\n {<\/span>
\n myListOP*<\/span> list =<\/span> myListDInit<\/span>(<\/span>printRec)<\/span>;<\/span>
\n mysqlite3_read<\/span>(<\/span>&<\/span>st-><\/span>patientRecord,<\/span>list)<\/span>;<\/span>
\n while<\/span> (<\/span>list-><\/span>packed ==<\/span> 0<\/span>)<\/span>
\n {<\/span>
\n res =<\/span> list-><\/span>pack<\/span>(<\/span>list,<\/span>buf,<\/span>560<\/span>,<\/span>sizeof<\/span>(<\/span>struct<\/span> patientRecord<\/span>)<\/span>)<\/span>;<\/span>
\n send<\/span>(<\/span>info-><\/span>fd,<\/span>buf,<\/span>res ,<\/span>0<\/span>)<\/span>;<\/span>
\n }<\/span>
\n list-><\/span>destory<\/span>(<\/span>list)<\/span>;<\/span>
\n }<\/span><\/p>\n

}<\/span>
\n return<\/span> 1<\/span>;<\/span>
\n}<\/span>
\nvoid<\/span> printEvent<\/span>(<\/span>struct<\/span> epoll_event<\/span> event)<\/span>{<\/span>
\n printf<\/span>(<\/span>"fd:%d,ptr:%p–>"<\/span>,<\/span>event.<\/span>data.<\/span>fd,<\/span>event.<\/span>data.<\/span>ptr)<\/span>;<\/span>
\n}<\/span><\/p>\n

int<\/span> main<\/span>(<\/span>int<\/span> argc,<\/span> char<\/span> const<\/span> *<\/span>argv[<\/span>]<\/span>)<\/span>
\n{<\/span>
\n if<\/span> (<\/span>argc<<\/span>2<\/span>)<\/span>
\n {<\/span>
\n printf<\/span>(<\/span>"\u8bf7\u8f93\u5165\u7aef\u53e3\u53f7\\\\n"<\/span>)<\/span>;<\/span>
\n return<\/span> 1<\/span>;<\/span>
\n }<\/span><\/p>\n

int<\/span> server =<\/span> socket<\/span>(<\/span>AF_INET,<\/span>SOCK_STREAM,<\/span>0<\/span>)<\/span>;<\/span>
\n sqlite3_open<\/span>(<\/span>"\/home\/mr-oy\/c-codes\/\u6570\u636e\u5e93\/hospital.db"<\/span>,<\/span>&<\/span>db)<\/span>;<\/span>
\n struct<\/span> sockaddr_in<\/span> addr=<\/span>{<\/span>0<\/span>}<\/span>;<\/span>
\n addr.<\/span>sin_family=<\/span>AF_INET;<\/span>
\n addr.<\/span>sin_port=<\/span>htons<\/span>(<\/span>atoi<\/span>(<\/span>argv[<\/span>1<\/span>]<\/span>)<\/span>)<\/span>;<\/span>
\n addr.<\/span>sin_addr.<\/span>s_addr=<\/span>inet_addr<\/span>(<\/span>"0.0.0.0"<\/span>)<\/span>;<\/span><\/p>\n

if<\/span>(<\/span>bind<\/span>(<\/span>server,<\/span>(<\/span>struct<\/span> sockaddr<\/span> *<\/span> )<\/span>&<\/span>addr,<\/span>sizeof<\/span>(<\/span>addr)<\/span>)<\/span>==<\/span>–<\/span>1<\/span>)<\/span>{<\/span>
\n perror<\/span>(<\/span>"bind:"<\/span>)<\/span>;<\/span>
\n return<\/span> 1<\/span>;<\/span>
\n }<\/span>
\n struct<\/span> sockaddr_in<\/span> client_addr =<\/span> {<\/span>0<\/span>}<\/span>;<\/span>
\n int<\/span> client_len =<\/span> sizeof<\/span>(<\/span>client_addr)<\/span>;<\/span><\/p>\n

int<\/span> ret;<\/span>
\n int<\/span> max =<\/span> 10<\/span>;<\/span>
\n listen<\/span>(<\/span>server,<\/span>max)<\/span>;<\/span>
\n char<\/span> ip_human[<\/span>16<\/span>]<\/span>=<\/span>""<\/span>;<\/span>
\n int<\/span> port_human =<\/span> 0<\/span>;<\/span>
\n \/\/\u521b\u5efa\u76d1\u89c6\u5217\u8868<\/span>
\n int<\/span> epoll_handler =<\/span> epoll_create1<\/span>(<\/span>EPOLL_CLOEXEC)<\/span>;<\/span>
\n \/\/ \u5c06\u670d\u52a1\u5668\u52a0\u5165\u5230handeler\u5185<\/span>
\n struct<\/span> epoll_event<\/span> serverEvent;<\/span>
\n serverEvent.<\/span>events=<\/span>EPOLLIN|<\/span>EPOLLET;<\/span>
\n serverEvent.<\/span>data.<\/span>fd=<\/span>server;<\/span>
\n epoll_ctl<\/span>(<\/span>epoll_handler,<\/span>EPOLL_CTL_ADD,<\/span>server,<\/span>&<\/span>serverEvent)<\/span>;<\/span><\/p>\n

int<\/span> client;<\/span>
\n fdList =<\/span> myListDInit<\/span>(<\/span>(<\/span>void<\/span>(<\/span>*<\/span>)<\/span>(<\/span>void<\/span>*<\/span>)<\/span>)<\/span>printInfo)<\/span>;<\/span>
\n struct<\/span> info<\/span> *<\/span> currentinfo=<\/span>0<\/span>;<\/span>
\n struct<\/span> epoll_event<\/span>*<\/span> currentevent=<\/span>0<\/span>;<\/span>
\n int<\/span>*<\/span> currentfd =<\/span>0<\/span>;<\/span>
\n unsigned<\/span> int<\/span> i=<\/span>0<\/span>;<\/span><\/p>\n

\/\/ fdList->append(fdList,creatInfo(0,server,&serverEvent));<\/span>
\n myArrayOP*<\/span> eventList =<\/span> myArrayInit<\/span>(<\/span>20<\/span>,<\/span>sizeof<\/span>(<\/span>struct<\/span> epoll_event<\/span>)<\/span>,<\/span>printEvent)<\/span>;<\/span><\/p>\n

printf<\/span>(<\/span>"\u670d\u52a1\u5668\u6b63\u5728\u8fd0\u884c:\\\\n"<\/span>)<\/span>;<\/span>
\n for<\/span> (<\/span>;<\/span>;<\/span>)<\/span>
\n {<\/span>
\n i=<\/span>0<\/span>;<\/span>
\n memset<\/span>(<\/span>eventList-><\/span>data,<\/span>0<\/span>,<\/span>eventList-><\/span>max_length*<\/span>eventList-><\/span>size)<\/span>;<\/span>
\n eventList-><\/span>length =<\/span> epoll_wait<\/span>(<\/span>epoll_handler,<\/span>eventList-><\/span>data,<\/span>eventList-><\/span>max_length,<\/span>–<\/span>1<\/span>)<\/span>;<\/span>
\n while<\/span> (<\/span>currentevent =<\/span> (<\/span>struct<\/span> epoll_event<\/span>*<\/span>)<\/span>eventList-><\/span>slice<\/span>(<\/span>eventList,<\/span>i++<\/span>)<\/span>)<\/span>
\n {<\/span>
\n currentfd =<\/span> &<\/span>(<\/span>currentevent-><\/span>data.<\/span>fd)<\/span>;<\/span>
\n if<\/span> (<\/span>*<\/span>currentfd ==<\/span> server)<\/span>\/\/\u6709\u65b0\u7684\u5ba2\u6237\u7aef\u8fde\u63a5<\/span>
\n {<\/span>
\n client =<\/span> accept<\/span>(<\/span>server,<\/span>(<\/span>struct<\/span> sockaddr<\/span> *<\/span> )<\/span>&<\/span>client_addr,<\/span>&<\/span>client_len)<\/span>;<\/span>
\n struct<\/span> epoll_event<\/span>*<\/span> clientevent =<\/span> malloc<\/span>(<\/span>sizeof<\/span>(<\/span>struct<\/span> epoll_event<\/span>)<\/span>)<\/span> ;<\/span>
\n memset<\/span>(<\/span>clientevent,<\/span>0<\/span>,<\/span>sizeof<\/span>(<\/span>struct<\/span> epoll_event<\/span>)<\/span>)<\/span>;<\/span>
\n clientevent-><\/span>data.<\/span>fd=<\/span>client;<\/span>
\n clientevent-><\/span>events=<\/span>EPOLLIN|<\/span>EPOLLET;<\/span>
\n fdList-><\/span>append<\/span>(<\/span>fdList,<\/span>creatInfo<\/span>(<\/span>&<\/span>client_addr,<\/span>client,<\/span>clientevent)<\/span>)<\/span>;<\/span>
\n epoll_ctl<\/span>(<\/span>epoll_handler,<\/span>EPOLL_CTL_ADD,<\/span>client,<\/span>clientevent)<\/span>;<\/span>
\n inet_ntop<\/span>(<\/span>AF_INET,<\/span>&<\/span>client_addr.<\/span>sin_addr,<\/span>ip_human,<\/span>16<\/span>)<\/span>;<\/span>
\n port_human=<\/span>ntohs<\/span>(<\/span>client_addr.<\/span>sin_port)<\/span>;<\/span>
\n printf<\/span>(<\/span>"\u5ba2\u6237\u7aef\u5df2\u8fde\u63a5:\\\\nIP:%s\\\\nport:%d\\\\n"<\/span>,<\/span>ip_human,<\/span>port_human)<\/span>;<\/span>
\n \/\/\u5c06\u8be5fd\u6dfb\u52a0\u5230epoll<\/span>
\n continue<\/span>;<\/span>;<\/span>
\n }<\/span>
\n \/\/\u5ba2\u6237\u7aef\u64cd\u4f5c<\/span>
\n else<\/span> if<\/span> (<\/span>*<\/span>currentfd !=<\/span> server)<\/span>
\n {<\/span>
\n unsigned<\/span> int<\/span> index=<\/span> fdList-><\/span>findby<\/span>(<\/span>fdList,<\/span>isSameInt,<\/span>getfd,<\/span>currentfd,<\/span>0<\/span>)<\/span>;<\/span>
\n \/\/ fdList->print(fdList);<\/span>
\n currentinfo =<\/span> fdList-><\/span>slice<\/span>(<\/span>fdList,<\/span>index)<\/span>;<\/span>
\n serverfun<\/span>(<\/span>currentinfo)<\/span>;<\/span>
\n }<\/span><\/p>\n

}<\/span><\/p>\n

}<\/span>
\n return<\/span> 0<\/span>;<\/span>
\n}<\/span><\/p>\n

client.c<\/p>\n

#<\/span>include<\/span> <stdio.h><\/span><\/span>
\n#<\/span>include<\/span> <string.h><\/span><\/span>
\n#<\/span>include<\/span> <unistd.h><\/span><\/span>
\n#<\/span>include<\/span> <stdlib.h><\/span><\/span>
\n#<\/span>include<\/span> <sys\/types.h><\/span><\/span>
\n#<\/span>include<\/span> <sys\/stat.h><\/span><\/span>
\n#<\/span>include<\/span> <fcntl.h><\/span><\/span>
\n#<\/span>include<\/span> <pthread.h><\/span><\/span>
\n#<\/span>include<\/span> <semaphore.h><\/span><\/span>
\n#<\/span>include<\/span> <wait.h><\/span><\/span>
\n#<\/span>include<\/span> <signal.h><\/span><\/span>
\n#<\/span>include<\/span> <sys\/socket.h><\/span><\/span>
\n#<\/span>include<\/span> <arpa\/inet.h><\/span><\/span>
\n#<\/span>include<\/span> <sys\/ipc.h><\/span><\/span>
\n#<\/span>include<\/span> <sys\/sem.h><\/span><\/span>
\n#<\/span>include<\/span> <semaphore.h><\/span><\/span>
\n#<\/span>include<\/span> <sys\/msg.h><\/span><\/span>
\n#<\/span>include<\/span> <sys\/shm.h><\/span><\/span>
\n#<\/span>include<\/span> <sys\/un.h><\/span><\/span>
\n#<\/span>include<\/span> "doublyList.h"<\/span><\/span>
\n#<\/span>include<\/span> "array.h"<\/span><\/span>
\nstruct<\/span> patientRecord<\/span>
\n{<\/span>
\n time_t<\/span> time;<\/span>
\n char<\/span> patientName[<\/span>40<\/span>]<\/span>;<\/span>
\n char<\/span> patientRec[<\/span>128<\/span>]<\/span>;<\/span>
\n char<\/span> doctorDia[<\/span>128<\/span>]<\/span>;<\/span>
\n char<\/span> tablet[<\/span>128<\/span>]<\/span>;<\/span>
\n char<\/span> doctorAdv[<\/span>128<\/span>]<\/span>;<\/span>
\n \/\/size=4*128+4+40=556<\/span>
\n}<\/span>;<\/span>
\nenum<\/span> enum_send_t<\/span>{<\/span>
\n send_record =<\/span>1<\/span>,<\/span>
\n read_record,<\/span>
\n}<\/span>;<\/span>
\nstruct<\/span> send_t<\/span>
\n{<\/span>
\n enum<\/span> enum_send_t<\/span> type;<\/span>
\n struct<\/span> patientRecord<\/span> patientRecord;<\/span>
\n}<\/span>;<\/span><\/p>\n

struct<\/span> send_t<\/span> *<\/span> createSend_t<\/span>(<\/span>enum<\/span> enum_send_t<\/span> type,<\/span>time_t<\/span> time,<\/span>char<\/span>*<\/span> patientName,<\/span>\\\\
\n char<\/span>*<\/span> patientRec,<\/span>char<\/span>*<\/span> doctorDia,<\/span>char<\/span>*<\/span> tablet,<\/span>char<\/span>*<\/span> doctorAdv)<\/span>{<\/span>
\n struct<\/span> send_t<\/span> *<\/span> st =<\/span> malloc<\/span> (<\/span>sizeof<\/span> (<\/span>struct<\/span> send_t<\/span>)<\/span>)<\/span>;<\/span>
\n st-><\/span>type =<\/span> type;<\/span>
\n struct<\/span> patientRecord<\/span> *<\/span>ret =<\/span> &<\/span>st-><\/span>patientRecord;<\/span>
\n memset<\/span>(<\/span>ret,<\/span>0<\/span>,<\/span>sizeof<\/span>(<\/span>struct<\/span> patientRecord<\/span>)<\/span>)<\/span>;<\/span>
\n ret-><\/span>time =<\/span> time;<\/span>
\n strcpy<\/span>(<\/span>ret-><\/span>patientName,<\/span>patientName)<\/span>;<\/span>
\n if<\/span> (<\/span>patientRec !=<\/span>0<\/span>)<\/span>
\n {<\/span><\/p>\n

strcpy<\/span>(<\/span>ret-><\/span>patientRec,<\/span>patientRec)<\/span>;<\/span>
\n strcpy<\/span>(<\/span>ret-><\/span>doctorDia,<\/span>doctorDia)<\/span>;<\/span>
\n strcpy<\/span>(<\/span>ret-><\/span>tablet,<\/span>tablet)<\/span>;<\/span>
\n strcpy<\/span>(<\/span>ret-><\/span>doctorAdv,<\/span>doctorAdv)<\/span>;<\/span>
\n }<\/span><\/p>\n

return<\/span> st;<\/span>
\n }<\/span><\/p>\n

static<\/span> void<\/span> printRec<\/span>(<\/span>struct<\/span> patientRecord<\/span>*<\/span> rec)<\/span>{<\/span>
\n char<\/span> timeStr[<\/span>64<\/span>]<\/span>;<\/span> \/\/ \u7528\u4e8e\u5b58\u50a8\u683c\u5f0f\u5316\u540e\u7684\u65f6\u95f4\u5b57\u7b26\u4e32<\/span>
\n strftime<\/span>(<\/span>timeStr,<\/span> sizeof<\/span>(<\/span>timeStr)<\/span>,<\/span> "%Y-%m-%d %H:%M:%S"<\/span>,<\/span> localtime<\/span>(<\/span>&<\/span>rec-><\/span>time)<\/span>)<\/span>;<\/span>
\n printf<\/span>(<\/span>"%s::\\\\n \u75c5\u4eba\u63cf\u8ff0:%s\\\\n, \u533b\u751f\u8bca\u65ad:%s\\\\n, \u5f00\u836f:%s\\\\n, \u533b\u5631:%s\\\\n"<\/span>,<\/span>
\n timeStr,<\/span> rec-><\/span>patientRec,<\/span> rec-><\/span>doctorDia,<\/span> rec-><\/span>tablet,<\/span> rec-><\/span>doctorAdv)<\/span>;<\/span>
\n}<\/span>
\nstatic<\/span> void<\/span> printSend_t<\/span>(<\/span>struct<\/span> send_t<\/span>*<\/span> send)<\/span>{<\/span>
\n if<\/span> (<\/span>send-><\/span>type ==<\/span> send_record)<\/span>
\n {<\/span>
\n printf<\/span>(<\/span>"send_record\\\\n"<\/span>)<\/span>;<\/span>
\n }<\/span>
\n if<\/span> (<\/span>send-><\/span>type ==<\/span> read_record)<\/span>
\n {<\/span>
\n printf<\/span>(<\/span>"read_record\\\\n"<\/span>)<\/span>;<\/span>
\n }<\/span><\/p>\n

printRec<\/span>(<\/span>&<\/span>send-><\/span>patientRecord)<\/span>;<\/span>
\n}<\/span>
\nint<\/span> main<\/span>(<\/span>int<\/span> argc,<\/span> char<\/span> const<\/span> *<\/span>argv[<\/span>]<\/span>)<\/span>
\n{<\/span>
\n if<\/span> (<\/span>argc<<\/span>3<\/span>)<\/span>
\n {<\/span>
\n printf<\/span>(<\/span>"\u8bf7\u8f93\u5165\u7aef\u53e3\u53f7\\\\n"<\/span>)<\/span>;<\/span>
\n printf<\/span>(<\/span>"\u8bf7\u8f93\u5165\u6a21\u5f0f\\\\n"<\/span>)<\/span>;<\/span>
\n return<\/span> 1<\/span>;<\/span>
\n }<\/span>
\n char<\/span> patientName[<\/span>40<\/span>]<\/span>;<\/span>
\n char<\/span> patientRec[<\/span>128<\/span>]<\/span>;<\/span>
\n char<\/span> doctorDia[<\/span>128<\/span>]<\/span>;<\/span>
\n char<\/span> tablet[<\/span>128<\/span>]<\/span>;<\/span>
\n char<\/span> doctorAdv[<\/span>128<\/span>]<\/span>;<\/span><\/p>\n

myListOP*<\/span> list =<\/span> myListDInit<\/span>(<\/span>printSend_t<\/span>)<\/span>;<\/span><\/p>\n

int<\/span> clinet =<\/span> socket<\/span>(<\/span>AF_INET,<\/span>SOCK_STREAM,<\/span>0<\/span>)<\/span>;<\/span>
\n struct<\/span> sockaddr_in<\/span> addr=<\/span>{<\/span>0<\/span>}<\/span>;<\/span>
\n addr.<\/span>sin_family=<\/span>AF_INET;<\/span>
\n addr.<\/span>sin_port=<\/span>htons<\/span>(<\/span>atoi<\/span>(<\/span>argv[<\/span>1<\/span>]<\/span>)<\/span>)<\/span>;<\/span>
\n addr.<\/span>sin_addr.<\/span>s_addr=<\/span>inet_addr<\/span>(<\/span>"127.0.0.1"<\/span>)<\/span>;<\/span><\/p>\n

char<\/span> buf[<\/span>560<\/span>]<\/span> =<\/span> {<\/span>0<\/span>}<\/span>;<\/span>
\n int<\/span> used =<\/span>0<\/span>;<\/span><\/p>\n

if<\/span>(<\/span>connect<\/span>(<\/span>clinet,<\/span>(<\/span>struct<\/span> sockaddr<\/span>*<\/span>)<\/span>&<\/span>addr,<\/span>sizeof<\/span>(<\/span>addr)<\/span>)<\/span>==<\/span>–<\/span>1<\/span>)<\/span>{<\/span>
\n perror<\/span>(<\/span>"connect:"<\/span>)<\/span>;<\/span>
\n return<\/span> 1<\/span>;<\/span>
\n }<\/span>
\n if<\/span> (<\/span>strcmp<\/span>(<\/span>argv[<\/span>2<\/span>]<\/span>,<\/span>"-u"<\/span>)<\/span>)<\/span>
\n {<\/span>
\n for<\/span> (<\/span>;<\/span>;<\/span>)<\/span>
\n {<\/span><\/p>\n

printf<\/span>(<\/span>"\u8bf7\u8f93\u5165\u75c5\u4eba\u59d3\u540d\\\\n"<\/span>)<\/span>;<\/span>
\n scanf<\/span>(<\/span>" %s"<\/span>,<\/span>patientName)<\/span>;<\/span>
\n printf<\/span>(<\/span>"\u8bf7\u8f93\u5165\u75c5\u4eba\u81ea\u8ff0\\\\n"<\/span>)<\/span>;<\/span>
\n scanf<\/span>(<\/span>" %s"<\/span>,<\/span>patientRec)<\/span>;<\/span>
\n printf<\/span>(<\/span>"\u8bf7\u8f93\u5165\u533b\u751f\u8bca\u65ad\\\\n"<\/span>)<\/span>;<\/span>
\n scanf<\/span>(<\/span>" %s"<\/span>,<\/span>doctorDia)<\/span>;<\/span>
\n printf<\/span>(<\/span>"\u8bf7\u8f93\u5165\u836f\u7269\\\\n"<\/span>)<\/span>;<\/span>
\n scanf<\/span>(<\/span>" %s"<\/span>,<\/span>tablet)<\/span>;<\/span>
\n printf<\/span>(<\/span>"\u8bf7\u8f93\u5165\u533b\u5631\\\\n"<\/span>)<\/span>;<\/span>
\n scanf<\/span>(<\/span>" %s"<\/span>,<\/span>doctorAdv)<\/span>;<\/span><\/p>\n

list-><\/span>append<\/span>(<\/span>list,<\/span>createSend_t<\/span>(<\/span>send_record,<\/span>time<\/span>(<\/span>NULL<\/span>)<\/span>,<\/span>\\\\
\n patientName,<\/span>patientRec,<\/span>doctorDia,<\/span>tablet,<\/span>doctorAdv
\n )<\/span>)<\/span>;<\/span>
\n used =<\/span> list-><\/span>pack<\/span>(<\/span>list,<\/span>buf,<\/span>560<\/span>,<\/span>560<\/span>)<\/span>;<\/span>
\n write<\/span>(<\/span>clinet,<\/span>buf,<\/span>used)<\/span>;<\/span>
\n }<\/span>
\n }<\/span>
\n else<\/span>{<\/span>
\n for<\/span> (<\/span>;<\/span>;<\/span>)<\/span>
\n {<\/span><\/p>\n

printf<\/span>(<\/span>"\u8bf7\u8f93\u5165\u75c5\u4eba\u59d3\u540d\\\\n"<\/span>)<\/span>;<\/span>
\n scanf<\/span>(<\/span>" %s"<\/span>,<\/span>patientName)<\/span>;<\/span>
\n list-><\/span>append<\/span>(<\/span>list,<\/span>createSend_t<\/span>(<\/span>read_record,<\/span>0<\/span>,<\/span>\\\\
\n patientName,<\/span>0<\/span>,<\/span>0<\/span>,<\/span>0<\/span>,<\/span>0<\/span>
\n )<\/span>)<\/span>;<\/span>
\n used =<\/span> list-><\/span>pack<\/span>(<\/span>list,<\/span>buf,<\/span>560<\/span>,<\/span>560<\/span>)<\/span>;<\/span>
\n write<\/span>(<\/span>clinet,<\/span>buf,<\/span>used)<\/span>;<\/span>
\n while<\/span> (<\/span>1<\/span>)<\/span>
\n {<\/span>
\n used =<\/span> read<\/span>(<\/span>clinet,<\/span>buf,<\/span>sizeof<\/span>(<\/span>unsigned<\/span> short<\/span> int<\/span>)<\/span>)<\/span>;<\/span>\/\/\u7406\u8bba\u4e0a\u4f1a\u5361\u6b7b\u5728\u8fd9\u884c,\u56de\u5934\u4f18\u5316<\/span>
\n int<\/span> size =<\/span> *<\/span>(<\/span>unsigned<\/span> short<\/span> int<\/span>*<\/span>)<\/span>buf;<\/span>
\n used =<\/span> read<\/span>(<\/span>clinet,<\/span>buf+<\/span>sizeof<\/span>(<\/span>unsigned<\/span> short<\/span> int<\/span>)<\/span>,<\/span>size–<\/span>sizeof<\/span>(<\/span>unsigned<\/span> short<\/span> int<\/span>)<\/span>)<\/span>;<\/span>
\n myListOP *<\/span> tmp =<\/span>0<\/span>;<\/span>
\n tmp =<\/span> myListDUnpack<\/span>(<\/span>0<\/span>,<\/span>buf,<\/span>printRec)<\/span>;<\/span>
\n tmp-><\/span>print<\/span>(<\/span>tmp)<\/span>;<\/span>
\n }<\/span><\/p>\n

}<\/span>
\n }<\/span><\/p>\n

return<\/span> 0<\/span>;<\/span>
\n}<\/span><\/p>\n

\u4f9d\u8d56: doublyLIst.c<\/p>\n

#<\/span>include<\/span> "doublyList.h"<\/span><\/span>
\n#<\/span>include<\/span> <stdlib.h><\/span><\/span>
\n#<\/span>include<\/span> <stdio.h><\/span><\/span>
\n#<\/span>include<\/span> <string.h><\/span><\/span>
\nstatic<\/span> int<\/span> isNull<\/span>(<\/span>myListOP *<\/span> self)<\/span>{<\/span>
\n return<\/span> self==<\/span>0<\/span> ||<\/span> self-><\/span>data==<\/span>0<\/span>;<\/span>\/\/\u5934\u7684\u4f4d\u7f6e\u662f\u7a7a,\u5219\u4e3anull<\/span>
\n}<\/span>
\nstatic<\/span> int<\/span> isEmpty<\/span>(<\/span>myListOP *<\/span> self)<\/span>{<\/span>
\n return<\/span> self-><\/span>data-><\/span>next==<\/span>0<\/span>||<\/span>self-><\/span>data-><\/span>data==<\/span>0<\/span>;<\/span>\/\/\u5934\u7684data\u7684\u6307\u9488\u6307\u5411\u81ea\u5df1\u5219\u4e3anull<\/span>
\n}<\/span>
\nstatic<\/span> int<\/span> isNullOrEmpty<\/span>(<\/span>myListOP *<\/span> self)<\/span>{<\/span>
\n return<\/span> isNull<\/span>(<\/span>self)<\/span>||<\/span>isEmpty<\/span>(<\/span>self)<\/span>;<\/span>
\n}<\/span>
\nstatic<\/span> void<\/span>*<\/span> dequeue<\/span>(<\/span>myListOP *<\/span> self)<\/span>{<\/span>
\n void<\/span> *<\/span> ret=<\/span>0<\/span>;<\/span>
\n if<\/span> (<\/span>isNullOrEmpty<\/span>(<\/span>self)<\/span>)<\/span>
\n {<\/span>
\n return<\/span> 0<\/span>;<\/span>
\n }<\/span>
\n if<\/span> (<\/span>self-><\/span>data-><\/span>next ==<\/span> self-><\/span>data)<\/span> \/\/\u53ea\u6709\u4e00\u4e2a\u7684\u60c5\u51b5\u4e0b<\/span>
\n {<\/span>
\n self-><\/span>length—<\/span>;<\/span>
\n ret =<\/span> self-><\/span>data-><\/span>data;<\/span>
\n self-><\/span>data-><\/span>data =<\/span>0<\/span>;<\/span>
\n return<\/span> ret;<\/span>
\n }<\/span><\/p>\n

myListP head =<\/span>self-><\/span>data;<\/span>
\n head-><\/span>prev-><\/span>next =<\/span> head-><\/span>next;<\/span>
\n head-><\/span>next-><\/span>prev=<\/span>head-><\/span>prev;<\/span>
\n self-><\/span>data=<\/span>head-><\/span>next;<\/span>
\n ret =<\/span> head-><\/span>data;<\/span><\/p>\n

self-><\/span>__head =<\/span>0<\/span>;<\/span> \/\/\u8fed\u4ee3\u5668\u91cd\u65b0\u751f\u6210<\/span>
\n self-><\/span>length—<\/span>;<\/span>
\n free<\/span>(<\/span>head)<\/span>;<\/span>
\n return<\/span> ret;<\/span>
\n}<\/span>
\nstatic<\/span> void<\/span> *<\/span>pop<\/span>(<\/span>myListOP *<\/span> self)<\/span>{<\/span>
\n if<\/span> (<\/span>isNullOrEmpty<\/span>(<\/span>self)<\/span>)<\/span>
\n {<\/span>
\n return<\/span> 0<\/span>;<\/span>
\n }<\/span>
\n void<\/span>*<\/span>ret;<\/span>
\n if<\/span> (<\/span>self-><\/span>data-><\/span>next ==<\/span> self-><\/span>data)<\/span> \/\/\u53ea\u6709\u4e00\u4e2a\u7684\u60c5\u51b5\u4e0b<\/span>
\n {<\/span>
\n self-><\/span>length—<\/span>;<\/span>
\n ret =<\/span> self-><\/span>data-><\/span>data;<\/span>
\n self-><\/span>data-><\/span>data =<\/span>0<\/span>;<\/span>
\n return<\/span> ret;<\/span>
\n }<\/span>
\n self-><\/span>length—<\/span>;<\/span>
\n self-><\/span>__head=<\/span>0<\/span>;<\/span>\/\/\u8fed\u4ee3\u5668\u91cd\u65b0\u751f\u6210<\/span>
\n myListP current=<\/span>self-><\/span>data;<\/span>
\n myListP prev=<\/span>0<\/span>;<\/span>
\n myListP next=<\/span>0<\/span>;<\/span><\/p>\n

current =<\/span> current-><\/span>prev;<\/span>\/\/\u5b9a\u4f4d\u5230\u5c3e\u90e8<\/span>
\n prev=<\/span>current-><\/span>prev;<\/span>
\n next=<\/span>current-><\/span>next;<\/span><\/p>\n

prev-><\/span>next=<\/span>next;<\/span>
\n next-><\/span>prev=<\/span>prev;<\/span><\/p>\n

ret=<\/span>current-><\/span>data;<\/span>
\n current-><\/span>data=<\/span>0<\/span>;<\/span>
\n free<\/span>(<\/span>current)<\/span>;<\/span>
\n return<\/span> ret;<\/span>
\n}<\/span><\/p>\n

static<\/span> myListP slice<\/span> (<\/span>myListOP *<\/span> self,<\/span>unsigned<\/span> int<\/span> i)<\/span>{<\/span>
\n if<\/span> (<\/span>isNullOrEmpty<\/span>(<\/span>self)<\/span>)<\/span> \/\/\u5224\u65ad\u662f\u5426\u4e3a\u7a7a<\/span>
\n {<\/span>
\n return<\/span> 0<\/span>;<\/span>
\n }<\/span>
\n \/\/\u671f\u5f85i\u57280~.length\u4e4b\u95f4<\/span>
\n \/\/\u533a\u95f4\u5206\u6210\u4e86\u4e09\u6bb5,0,__index,length,\u67e5\u770bi\u79bb\u54ea\u4e2a\u66f4\u8fd1<\/span>
\n unsigned<\/span> int<\/span> distanceFromHead =<\/span> i;<\/span>
\n unsigned<\/span> int<\/span> distanceFromTail =<\/span> self-><\/span>length –<\/span> i;<\/span>
\n unsigned<\/span> int<\/span> distanceFromCurrent =<\/span> i –<\/span> self-><\/span>__index;<\/span>
\n distanceFromCurrent=<\/span>distanceFromCurrent><\/span>0<\/span>?<\/span>distanceFromCurrent:<\/span>–<\/span>distanceFromCurrent;<\/span>
\n if<\/span> (<\/span>distanceFromHead <=<\/span> distanceFromTail &&<\/span> distanceFromHead <=<\/span> distanceFromCurrent)<\/span>
\n {<\/span>
\n \/\/i\u79bb\u5934\u66f4\u8fd1，\u4ece\u5934\u5f00\u59cb\u904d\u5386<\/span>
\n self-><\/span>__index =<\/span> 0<\/span>;<\/span>
\n self-><\/span>__last =<\/span> self-><\/span>data;<\/span>
\n self-><\/span>__head =<\/span> self-><\/span>data;<\/span>
\n }<\/span>
\n else<\/span> if<\/span> (<\/span>distanceFromTail <<\/span> distanceFromHead &&<\/span> distanceFromTail <=<\/span> distanceFromCurrent)<\/span>
\n {<\/span>
\n \/\/i\u79bb\u5c3e\u66f4\u8fd1，\u4ece\u5c3e\u5f00\u59cb\u904d\u5386<\/span>
\n self-><\/span>__index =<\/span> self-><\/span>length –<\/span> 1<\/span>;<\/span>
\n self-><\/span>__last =<\/span> self-><\/span>data-><\/span>prev;<\/span>
\n }<\/span>
\n if<\/span> (<\/span>self-><\/span>__head !=<\/span> self-><\/span>data)<\/span>
\n {<\/span>
\n self-><\/span>__index =<\/span>0<\/span>;<\/span>
\n self-><\/span>__last =<\/span> self-><\/span>data;<\/span>
\n self-><\/span>__head=<\/span>self-><\/span>data;<\/span>
\n }<\/span>
\n if<\/span> (<\/span>i ==<\/span> 0<\/span>)<\/span>
\n {<\/span>
\n return<\/span> self-><\/span>data;<\/span>
\n }<\/span>
\n for<\/span> (<\/span> ;<\/span> self-><\/span>__index <<\/span> i;<\/span> self-><\/span>__index++<\/span>)<\/span>
\n {<\/span>
\n self-><\/span>__last =<\/span> self-><\/span>__last-><\/span>next;<\/span>
\n if<\/span> (<\/span>self-><\/span>__last ==<\/span> self-><\/span>__head)<\/span>
\n {<\/span>
\n break<\/span>;<\/span>
\n }<\/span><\/p>\n

}<\/span>
\n for<\/span> (<\/span>;<\/span> self-><\/span>__index ><\/span> i;<\/span> self-><\/span>__index—<\/span>)<\/span>
\n {<\/span>
\n self-><\/span>__last =<\/span> self-><\/span>__last-><\/span>prev;<\/span>
\n if<\/span> (<\/span>self-><\/span>__last ==<\/span> self-><\/span>__head)<\/span>
\n {<\/span>
\n break<\/span>;<\/span>
\n }<\/span>
\n }<\/span>
\n return<\/span> self-><\/span>__last ==<\/span> self-><\/span>data?<\/span>0<\/span>:<\/span>self-><\/span>__last;<\/span>
\n}<\/span>
\nstatic<\/span> void<\/span>*<\/span> _slice<\/span>(<\/span>myListOP *<\/span> self,<\/span>unsigned<\/span> int<\/span> i)<\/span>{<\/span>
\n \/\/ \u8fd9\u91cc\u662f\u540e\u5b9e\u73b0\u7684,\u4e3a\u4e86\u907f\u514d\u5bf9\u5185\u90e8\u51fd\u6570\u8fdb\u884c\u91cd\u6784,\u672a\u5bf9slice\u65b9\u6cd5\u8fdb\u884c\u91cd\u547d\u540d<\/span>
\n \/\/ \u5b9e\u9645\u7528\u6237\u4f7f\u7528\u7684slice\u5e94\u5f53\u4e3a_slice<\/span>
\n \/\/ \u4f7f\u7528\u7684_slice\u5e94\u5f53\u4e3aslice<\/span>
\n \/\/ 2025\/5\/9 \u4fee\u590d\u53ef\u80fd\u7684\u6bb5\u9519\u8bef<\/span>
\n myListP obj =<\/span> slice<\/span>(<\/span>self,<\/span>i)<\/span>;<\/span>
\n return<\/span> obj?<\/span>obj-><\/span>data:<\/span>obj;<\/span>
\n}<\/span>
\nstatic<\/span> void<\/span>*<\/span>del<\/span>(<\/span>struct<\/span> myListOP<\/span>*<\/span>self,<\/span>unsigned<\/span> int<\/span> where)<\/span>{<\/span>
\n if<\/span> (<\/span>isNullOrEmpty<\/span>(<\/span>self)<\/span>)<\/span>
\n {<\/span>
\n return<\/span> 0<\/span>;<\/span>
\n }<\/span>
\n if<\/span> (<\/span>where ==<\/span> 0<\/span>)<\/span>
\n {<\/span>
\n return<\/span> dequeue<\/span>(<\/span>self)<\/span>;<\/span>
\n }<\/span>
\n if<\/span> (<\/span>where ==<\/span> self-><\/span>length–<\/span>1<\/span>)<\/span>
\n {<\/span>
\n return<\/span> pop<\/span>(<\/span>self)<\/span>;<\/span>
\n }<\/span><\/p>\n

\/\/\u5b58\u57282\u4e2a\u4ee5\u4e0a\u7684\u5143\u7d20<\/span>
\n myListP last=<\/span>slice<\/span>(<\/span>self,<\/span>where–<\/span>1<\/span>)<\/span>;<\/span>
\n myListP current=<\/span>slice<\/span>(<\/span>self,<\/span>where)<\/span>;<\/span>
\n myListP next=<\/span>slice<\/span>(<\/span>self,<\/span>where+<\/span>1<\/span>)<\/span>;<\/span>
\n void<\/span> *<\/span> ret=<\/span>0<\/span>;<\/span>
\n last-><\/span>next=<\/span>next;<\/span>
\n next-><\/span>prev=<\/span>last;<\/span>
\n ret=<\/span>current-><\/span>data;<\/span>
\n free<\/span>(<\/span>current)<\/span>;<\/span>
\n self-><\/span>length —<\/span>;<\/span>
\n self-><\/span>__head =<\/span>0<\/span>;<\/span>\/\/\u8fed\u4ee3\u5668\u91cd\u65b0\u751f\u6210<\/span>
\n return<\/span> ret;<\/span>
\n}<\/span>
\nstatic<\/span> int<\/span> _insertHead<\/span>(<\/span>struct<\/span> myListOP<\/span>*<\/span>self,<\/span>void<\/span>*<\/span> data)<\/span>{<\/span>
\n if<\/span> (<\/span>isNull<\/span>(<\/span>self)<\/span>)<\/span>
\n {<\/span>
\n return<\/span> 0<\/span>;<\/span>
\n }<\/span>
\n if<\/span> (<\/span>self-><\/span>data-><\/span>data ==<\/span>0<\/span>)<\/span>
\n {<\/span>
\n self-><\/span>data-><\/span>data=<\/span>data;<\/span>
\n self-><\/span>__head =<\/span>0<\/span>;<\/span>\/\/\u8fed\u4ee3\u5668<\/span>
\n self-><\/span>length++<\/span>;<\/span>
\n return<\/span> 1<\/span>;<\/span>
\n }<\/span>
\n myListP current=<\/span>(<\/span>myListP)<\/span> malloc<\/span>(<\/span>sizeof<\/span>(<\/span>myList)<\/span>)<\/span>;<\/span>
\n current-><\/span>data=<\/span>data;<\/span>
\n current-><\/span>next=<\/span>self-><\/span>data;<\/span>
\n current-><\/span>prev=<\/span>self-><\/span>data-><\/span>prev;<\/span>
\n self-><\/span>data-><\/span>prev-><\/span>next=<\/span>current;<\/span>
\n self-><\/span>data-><\/span>prev=<\/span>current;<\/span>
\n self-><\/span>length++<\/span>;<\/span>
\n \/\/ self->data->prev->next=current;<\/span>
\n self-><\/span>data=<\/span>current;<\/span> \/\/\u8fed\u4ee3\u5668\u91cd\u65b0\u751f\u6210<\/span>
\n return<\/span> 1<\/span>;<\/span>
\n}<\/span>
\nstatic<\/span> int<\/span> append<\/span>(<\/span>struct<\/span> myListOP<\/span>*<\/span>self,<\/span>void<\/span>*<\/span> data)<\/span>{<\/span>
\n if<\/span> (<\/span>isNull<\/span>(<\/span>self)<\/span>)<\/span>
\n {<\/span>
\n return<\/span> 0<\/span>;<\/span>
\n }<\/span>
\n if<\/span> (<\/span>self-><\/span>data-><\/span>data ==<\/span>0<\/span>)<\/span>
\n {<\/span>
\n self-><\/span>data-><\/span>data=<\/span>data;<\/span>
\n self-><\/span>__head =<\/span>0<\/span>;<\/span>\/\/\u8fed\u4ee3\u5668<\/span>
\n self-><\/span>length++<\/span>;<\/span>
\n return<\/span> 1<\/span>;<\/span>
\n }<\/span><\/p>\n

myListP current=<\/span>(<\/span>myListP)<\/span> malloc<\/span>(<\/span>sizeof<\/span>(<\/span>myList)<\/span>)<\/span>;<\/span>
\n myListP head =<\/span> self-><\/span>data;<\/span>
\n current-><\/span>data=<\/span>data;<\/span>
\n current-><\/span>next=<\/span>head;<\/span>
\n current-><\/span>prev=<\/span>head-><\/span>prev;<\/span>
\n head-><\/span>prev-><\/span>next=<\/span>current;<\/span>
\n head-><\/span>prev=<\/span>current;<\/span>
\n self-><\/span>__head =<\/span>0<\/span>;<\/span>\/\/\u8fed\u4ee3\u5668<\/span>
\n self-><\/span>length++<\/span>;<\/span>
\n return<\/span> 1<\/span>;<\/span>
\n}<\/span>
\nstatic<\/span> int<\/span> insert<\/span>(<\/span>struct<\/span> myListOP<\/span>*<\/span>self,<\/span>unsigned<\/span> int<\/span> where,<\/span>void<\/span>*<\/span> data)<\/span>{<\/span>
\n if<\/span> (<\/span>isNull<\/span>(<\/span>self)<\/span>)<\/span>
\n {<\/span>
\n return<\/span> 0<\/span>;<\/span>
\n }<\/span>
\n if<\/span> (<\/span>where ==<\/span>0<\/span> )<\/span>
\n {<\/span>
\n return<\/span> _insertHead<\/span>(<\/span>self,<\/span>data)<\/span>;<\/span>
\n }<\/span>
\n if<\/span> (<\/span>where ==<\/span>self-><\/span>length )<\/span>
\n {<\/span>
\n return<\/span> append<\/span>(<\/span>self,<\/span>data)<\/span>;<\/span>
\n }<\/span><\/p>\n

myListP last=<\/span>slice<\/span>(<\/span>self,<\/span>where–<\/span>1<\/span>)<\/span>;<\/span> \/\/\u6700\u5c0f where =1<\/span>
\n myListP current=<\/span>(<\/span>myListP)<\/span> malloc<\/span>(<\/span>sizeof<\/span>(<\/span>myList)<\/span>)<\/span>;<\/span>
\n myListP next=<\/span>slice<\/span>(<\/span>self,<\/span>where)<\/span>;<\/span><\/p>\n

current-><\/span>data=<\/span>data;<\/span><\/p>\n

current-><\/span>next=<\/span>next;<\/span>
\n current-><\/span>prev=<\/span>last;<\/span>
\n last-><\/span>next=<\/span>current;<\/span>
\n next-><\/span>prev=<\/span>current;<\/span>
\n self-><\/span>__head =<\/span>0<\/span>;<\/span>
\n self-><\/span>length++<\/span>;<\/span>
\n return<\/span> 1<\/span>;<\/span>
\n}<\/span>
\nstatic<\/span> int<\/span> delAll<\/span>(<\/span>struct<\/span> myListOP<\/span>*<\/span>self,<\/span>unsigned<\/span> int<\/span> where)<\/span>{<\/span>
\n void<\/span> *<\/span> data =<\/span> del<\/span>(<\/span>self,<\/span>where)<\/span>;<\/span>
\n if<\/span> (<\/span>data)<\/span>
\n {<\/span>
\n free<\/span>(<\/span>data)<\/span>;<\/span>
\n return<\/span> 1<\/span>;<\/span>
\n }<\/span>
\n return<\/span> 0<\/span>;<\/span>
\n}<\/span><\/p>\n

static<\/span> unsigned<\/span> int<\/span> find<\/span>(<\/span>struct<\/span> myListOP<\/span>*<\/span>self,<\/span>void<\/span>*<\/span> obj,<\/span>unsigned<\/span> int<\/span> times)<\/span>{<\/span>
\n myListP p =<\/span>0<\/span>;<\/span>
\n unsigned<\/span> int<\/span> count =<\/span>0<\/span>;<\/span>
\n for<\/span> (<\/span>unsigned<\/span> int<\/span> i =<\/span> 0<\/span>;<\/span> i <<\/span> –<\/span>1<\/span>;<\/span> i++<\/span>)<\/span>
\n {<\/span>
\n p=<\/span>slice<\/span>(<\/span>self,<\/span>i)<\/span>;<\/span>
\n if<\/span> (<\/span>p==<\/span>0<\/span>)<\/span>
\n {<\/span>
\n break<\/span>;<\/span>
\n }<\/span>
\n if<\/span> (<\/span>p-><\/span>data==<\/span>obj)<\/span>
\n {<\/span>
\n if<\/span> (<\/span>times ==<\/span> count)<\/span>
\n {<\/span>
\n return<\/span> i;<\/span>
\n }<\/span>
\n count ++<\/span>;<\/span>
\n }<\/span><\/p>\n

}<\/span>
\n return<\/span> –<\/span>1<\/span>;<\/span>
\n}<\/span>
\nstatic<\/span> unsigned<\/span> int<\/span> findby<\/span>(<\/span>struct<\/span> myListOP<\/span>*<\/span>self,<\/span>int<\/span>(<\/span>*<\/span>cmp)<\/span>(<\/span>void<\/span>*<\/span>,<\/span>void<\/span>*<\/span>)<\/span>,<\/span>void<\/span>*<\/span>(<\/span>*<\/span>filed)<\/span>(<\/span>void<\/span>*<\/span>)<\/span>,<\/span>void<\/span>*<\/span>target,<\/span>unsigned<\/span> int<\/span> times)<\/span>{<\/span>\/\/cmp\u5e94\u8be5\u8fd4\u56de\u662f\u5426\u662f\u8981\u627e\u7684\u503c<\/span>
\n myListP p =<\/span>0<\/span>;<\/span>
\n unsigned<\/span> int<\/span> count =<\/span>0<\/span>;<\/span>
\n for<\/span> (<\/span>unsigned<\/span> int<\/span> i =<\/span> 0<\/span>;<\/span> i <<\/span> –<\/span>1<\/span>;<\/span> i++<\/span>)<\/span>
\n {<\/span>
\n p=<\/span>slice<\/span>(<\/span>self,<\/span>i)<\/span>;<\/span>
\n if<\/span> (<\/span>p==<\/span>0<\/span>)<\/span>
\n {<\/span>
\n break<\/span>;<\/span>
\n }<\/span>
\n if<\/span> (<\/span>cmp<\/span>(<\/span>filed<\/span>(<\/span>p-><\/span>data)<\/span>,<\/span>target)<\/span>==<\/span>0<\/span>)<\/span>
\n {<\/span>
\n if<\/span> (<\/span>times ==<\/span> count)<\/span>
\n {<\/span>
\n return<\/span> i;<\/span>
\n }<\/span>
\n count ++<\/span>;<\/span>
\n }<\/span>
\n }<\/span>
\n return<\/span> –<\/span>1<\/span>;<\/span>
\n}<\/span>
\nstatic<\/span> unsigned<\/span> int<\/span> unicNoFree<\/span> (<\/span>struct<\/span> myListOP<\/span>*<\/span>self,<\/span>void<\/span>*<\/span>(<\/span>*<\/span>field)<\/span>(<\/span>void<\/span>*<\/span>)<\/span>,<\/span>long<\/span> unsigned<\/span> int<\/span> size,<\/span>unsigned<\/span> int<\/span> times)<\/span>{<\/span>
\n unsigned<\/span> int<\/span> count=<\/span>0<\/span>;<\/span>
\n unsigned<\/span> int<\/span> ret =<\/span>0<\/span>;<\/span>
\n for<\/span> (<\/span>unsigned<\/span> int<\/span> i =<\/span> 1<\/span>;<\/span> i <<\/span> self-><\/span>length;<\/span> i++<\/span>)<\/span>
\n {<\/span>
\n count =<\/span>0<\/span>;<\/span>
\n for<\/span> (<\/span>unsigned<\/span> int<\/span> j =<\/span> i+<\/span>1<\/span>;<\/span> j <<\/span> self-><\/span>length;<\/span> j++<\/span>)<\/span>
\n {<\/span>
\n if<\/span> (<\/span>memcmp<\/span>(<\/span>field<\/span>(<\/span>slice<\/span>(<\/span>self,<\/span>i)<\/span>-><\/span>data)<\/span>,<\/span>field<\/span>(<\/span>slice<\/span>(<\/span>self,<\/span>j)<\/span>-><\/span>data)<\/span>,<\/span>size)<\/span>==<\/span>0<\/span>)<\/span>
\n {<\/span>
\n if<\/span> (<\/span>count >=<\/span> times)<\/span>
\n {<\/span>
\n self-><\/span>delNoFree<\/span>(<\/span>self,<\/span>j)<\/span>;<\/span>
\n j=<\/span>j–<\/span>1<\/span>;<\/span>
\n }<\/span>
\n count=<\/span>count+<\/span>1<\/span>;<\/span>
\n ret =<\/span> ret+<\/span>1<\/span>;<\/span>
\n }<\/span>
\n }<\/span>
\n }<\/span>
\n return<\/span> ret;<\/span>
\n}<\/span>
\nstatic<\/span> unsigned<\/span> int<\/span> unic<\/span> (<\/span>struct<\/span> myListOP<\/span>*<\/span>self,<\/span>void<\/span>*<\/span>(<\/span>*<\/span>field)<\/span>(<\/span>void<\/span>*<\/span>)<\/span>,<\/span>long<\/span> unsigned<\/span> int<\/span> size,<\/span>unsigned<\/span> int<\/span> times)<\/span>{<\/span>
\n unsigned<\/span> int<\/span> count=<\/span>0<\/span>;<\/span>
\n unsigned<\/span> int<\/span> ret =<\/span>0<\/span>;<\/span>
\n for<\/span> (<\/span>unsigned<\/span> int<\/span> i =<\/span> 1<\/span>;<\/span> i <<\/span> self-><\/span>length;<\/span> i++<\/span>)<\/span>
\n {<\/span>
\n count =<\/span>0<\/span>;<\/span>
\n for<\/span> (<\/span>unsigned<\/span> int<\/span> j =<\/span> i+<\/span>1<\/span>;<\/span> j <<\/span> self-><\/span>length;<\/span> j++<\/span>)<\/span>
\n {<\/span>
\n if<\/span> (<\/span>memcmp<\/span>(<\/span>field<\/span>(<\/span>slice<\/span>(<\/span>self,<\/span>i)<\/span>-><\/span>data)<\/span>,<\/span>field<\/span>(<\/span>slice<\/span>(<\/span>self,<\/span>j)<\/span>-><\/span>data)<\/span>,<\/span>size)<\/span>==<\/span>0<\/span>)<\/span>
\n {<\/span>
\n if<\/span> (<\/span>count >=<\/span> times)<\/span>
\n {<\/span>
\n self-><\/span>del<\/span>(<\/span>self,<\/span>j)<\/span>;<\/span>
\n j=<\/span>j–<\/span>1<\/span>;<\/span>
\n }<\/span>
\n count=<\/span>count+<\/span>1<\/span>;<\/span>
\n ret =<\/span> ret+<\/span>1<\/span>;<\/span>
\n }<\/span>
\n }<\/span>
\n }<\/span>
\n return<\/span> ret;<\/span>
\n}<\/span><\/p>\n

static<\/span> void<\/span> print<\/span>(<\/span>struct<\/span> myListOP<\/span>*<\/span>self)<\/span>{<\/span><\/p>\n

\/\/ for (unsigned int i = 0; i < self->length; i++)<\/span>
\n \/\/ {<\/span>
\n \/\/ self->__str(self->slice(self,i)->data);<\/span>
\n \/\/ }<\/span>
\n myListP cur=<\/span>self-><\/span>data;<\/span>
\n if<\/span> (<\/span>isNullOrEmpty<\/span>(<\/span>self)<\/span>)<\/span>
\n {<\/span>
\n return<\/span>;<\/span>
\n }<\/span>
\n do<\/span>{<\/span>
\n self-><\/span>__str<\/span>(<\/span>cur-><\/span>data)<\/span>;<\/span>
\n cur=<\/span>cur-><\/span>next;<\/span>
\n }<\/span>while<\/span> (<\/span>cur!=<\/span>self-><\/span>data)<\/span>;<\/span><\/p>\n

printf<\/span>(<\/span>"\\\\n"<\/span>)<\/span>;<\/span>
\n}<\/span><\/p>\n

static<\/span> void<\/span> destory<\/span> (<\/span>myListOP *<\/span>self)<\/span>{<\/span>
\n for<\/span> (<\/span>unsigned<\/span> int<\/span> i =<\/span> 0<\/span>;<\/span> i <<\/span> self-><\/span>length;<\/span> i++<\/span>)<\/span>
\n {<\/span>
\n self-><\/span>del<\/span>(<\/span>self,<\/span>0<\/span>)<\/span>;<\/span>
\n }<\/span>
\n free<\/span>(<\/span>self-><\/span>data)<\/span>;<\/span>
\n self-><\/span>data=<\/span>0<\/span>;<\/span>
\n free<\/span> (<\/span>self)<\/span>;<\/span>
\n}<\/span>
\nstatic<\/span> void<\/span> destoryNoFree<\/span> (<\/span>myListOP *<\/span>self)<\/span>{<\/span>
\n for<\/span> (<\/span>unsigned<\/span> int<\/span> i =<\/span> 0<\/span>;<\/span> i <<\/span> self-><\/span>length;<\/span> i++<\/span>)<\/span>
\n {<\/span>
\n del<\/span>(<\/span>self,<\/span>0<\/span>)<\/span>;<\/span>
\n }<\/span>
\n \/\/ free(self->data);<\/span>
\n self-><\/span>data=<\/span>0<\/span>;<\/span>
\n free<\/span> (<\/span>self)<\/span>;<\/span>
\n}<\/span>
\nstatic<\/span> void<\/span> _quickSort<\/span>(<\/span>myListOP *<\/span>self,<\/span>long<\/span> int<\/span> start,<\/span>long<\/span> int<\/span> end,<\/span>int<\/span>(<\/span>*<\/span>cmp)<\/span>(<\/span>void<\/span>*<\/span>,<\/span> void<\/span>*<\/span>)<\/span>,<\/span>void<\/span>*<\/span>(<\/span>*<\/span>filed)<\/span>(<\/span>void<\/span>*<\/span>)<\/span>,<\/span>int<\/span> reverse)<\/span>{<\/span>
\n if<\/span> (<\/span>start <<\/span> end)<\/span> {<\/span>
\n void<\/span>*<\/span> base =<\/span> slice<\/span>(<\/span>self,<\/span> start)<\/span>-><\/span>data;<\/span> \/\/ \u4ee5\u8981\u8fdb\u884c\u6392\u5e8f\u6570\u7ec4\u7b2c0\u4e2a\u5143\u7d20\u4e3abase<\/span>
\n int<\/span> left =<\/span> start;<\/span> \/\/ \u5de6\u6307\u9488<\/span>
\n int<\/span> right =<\/span> end;<\/span> \/\/ \u53f3\u6307\u9488<\/span><\/p>\n

while<\/span> (<\/span>left <<\/span> right)<\/span> {<\/span>
\n \/\/ \u4ece\u53f3\u5411\u5de6\u627e，\u627e\u5230\u6bd4base\u5c0f\u7684\u5143\u7d20<\/span>
\n while<\/span> (<\/span>left <<\/span> right &&<\/span> (<\/span>cmp<\/span>(<\/span>filed<\/span>(<\/span>slice<\/span>(<\/span>self,<\/span> right)<\/span>-><\/span>data)<\/span>,<\/span> filed<\/span>(<\/span>base)<\/span>)<\/span> *<\/span> reverse)<\/span> >=<\/span> 0<\/span>)<\/span> {<\/span>
\n right—<\/span>;<\/span>
\n }<\/span>
\n \/\/ \u6bd4base\u5c0f，\u66ff\u6362left\u6240\u5728\u4f4d\u7f6e\u7684\u5143\u7d20<\/span>
\n slice<\/span>(<\/span>self,<\/span> left)<\/span>-><\/span>data =<\/span> slice<\/span>(<\/span>self,<\/span> right)<\/span>-><\/span>data;<\/span><\/p>\n

\/\/ \u4ece\u5de6\u5411\u53f3\u627e，\u627e\u5230\u6bd4base\u5927\u7684\u5143\u7d20<\/span>
\n while<\/span> (<\/span>left <<\/span> right &&<\/span> (<\/span>cmp<\/span>(<\/span>filed<\/span>(<\/span>slice<\/span>(<\/span>self,<\/span> left)<\/span>-><\/span>data)<\/span>,<\/span> filed<\/span>(<\/span>base)<\/span>)<\/span> *<\/span> reverse)<\/span> <=<\/span> 0<\/span>)<\/span> {<\/span>
\n left++<\/span>;<\/span>
\n }<\/span>
\n \/\/ \u6bd4base\u5927，\u66ff\u6362right\u6240\u5728\u4f4d\u7f6e\u7684\u5143\u7d20<\/span>
\n slice<\/span>(<\/span>self,<\/span> right)<\/span>-><\/span>data =<\/span> slice<\/span>(<\/span>self,<\/span> left)<\/span>-><\/span>data;<\/span>
\n }<\/span>
\n slice<\/span>(<\/span>self,<\/span> left)<\/span>-><\/span>data =<\/span> base;<\/span> \/\/ \u5c06base\u653e\u5230\u6b63\u786e\u7684\u4f4d\u7f6e<\/span><\/p>\n

\/\/ \u9012\u5f52\u6392\u5e8f\u5de6\u53f3\u5b50\u6570\u7ec4<\/span>
\n _quickSort<\/span>(<\/span>self,<\/span> start,<\/span> left –<\/span> 1<\/span>,<\/span> cmp,<\/span>filed ,<\/span>reverse)<\/span>;<\/span>
\n _quickSort<\/span>(<\/span>self,<\/span> left +<\/span> 1<\/span>,<\/span> end,<\/span> cmp,<\/span>filed,<\/span> reverse)<\/span>;<\/span>
\n }<\/span>
\n}<\/span>
\nstatic<\/span> void<\/span> quickSort<\/span>(<\/span>myListOP *<\/span>self,<\/span>int<\/span>(<\/span>*<\/span>cmp)<\/span>(<\/span>void<\/span>*<\/span>,<\/span> void<\/span>*<\/span>)<\/span>,<\/span>void<\/span>*<\/span>(<\/span>*<\/span>filed)<\/span>(<\/span>void<\/span>*<\/span>)<\/span>,<\/span>int<\/span> reverse)<\/span>{<\/span>
\n if<\/span> (<\/span>isNullOrEmpty<\/span>(<\/span>self)<\/span>)<\/span>
\n {<\/span>
\n return<\/span>;<\/span>
\n }<\/span>
\n return<\/span> _quickSort<\/span>(<\/span>self,<\/span>0<\/span>,<\/span>self-><\/span>length–<\/span>1<\/span>,<\/span>cmp,<\/span>filed,<\/span>reverse)<\/span>;<\/span>
\n}<\/span><\/p>\n

static<\/span> unsigned<\/span> short<\/span> int<\/span> mysizeof<\/span>(<\/span>char<\/span> *<\/span> obj,<\/span>unsigned<\/span> short<\/span> int<\/span> size,<\/span>unsigned<\/span> int<\/span> i)<\/span>{<\/span>
\n if<\/span> (<\/span>obj==<\/span>0<\/span>||<\/span>size==<\/span>0<\/span>)<\/span>{<\/span>return<\/span> 0<\/span>;<\/span>}<\/span>
\n for<\/span> (<\/span>;<\/span> size><\/span>1<\/span>&&<\/span>*<\/span>(<\/span>char<\/span>*<\/span>)<\/span>(<\/span>obj+<\/span>size–<\/span>1<\/span>)<\/span> –<\/span> *<\/span>(<\/span>char<\/span>*<\/span>)<\/span>(<\/span>obj+<\/span>size–<\/span>2<\/span>)<\/span>==<\/span>0<\/span>;<\/span> size—<\/span>)<\/span>;<\/span>\/\/\u5c3e\u5730\u5740\u4e3aobj+size-1<\/span>
\n return<\/span> size;<\/span>
\n}<\/span>
\nstatic<\/span> unsigned<\/span> int<\/span> pack<\/span>(<\/span>myListOP *<\/span>self,<\/span>char<\/span>*<\/span> buf,<\/span>unsigned<\/span> int<\/span> length,<\/span>unsigned<\/span> short<\/span> int<\/span> max_size)<\/span>{<\/span>
\n return<\/span> self-><\/span>packVarLength<\/span>(<\/span>self,<\/span>buf,<\/span>length,<\/span>(<\/span>unsigned<\/span> short<\/span> int<\/span>(<\/span>*<\/span>)<\/span>(<\/span>void<\/span>*<\/span>,<\/span>unsigned<\/span> short<\/span> int<\/span> ,<\/span>unsigned<\/span> int<\/span> )<\/span>)<\/span>mysizeof,<\/span>max_size)<\/span>;<\/span>
\n}<\/span>
\nunsigned<\/span> int<\/span> packVarLength<\/span>(<\/span>myListOP *<\/span>self,<\/span>char<\/span>*<\/span> buf,<\/span>unsigned<\/span> int<\/span> length,<\/span>unsigned<\/span> short<\/span> (<\/span>*<\/span>sizefun)<\/span>(<\/span>void<\/span>*<\/span> obj,<\/span>unsigned<\/span> short<\/span> int<\/span> max_size,<\/span>unsigned<\/span> int<\/span> i)<\/span>,<\/span>unsigned<\/span> short<\/span> int<\/span> max_size)<\/span>{<\/span>
\n \/\/\u5c06\u5bf9\u8c61\u6253\u5305\u6210\u5b57\u8282\u6d41<\/span>
\n unsigned<\/span> int<\/span> used=<\/span>0<\/span>;<\/span>
\n void<\/span>*<\/span> obj=<\/span>0<\/span>;<\/span>
\n unsigned<\/span> short<\/span> int<\/span> size=<\/span>0<\/span>;<\/span>
\n unsigned<\/span> short<\/span> int<\/span> min_buf_len =<\/span> sizeof<\/span>(<\/span>unsigned<\/span> short<\/span> int<\/span>)<\/span>*<\/span>2<\/span>;<\/span>
\n self-><\/span>packed=<\/span>0<\/span>;<\/span>
\n if<\/span> (<\/span>self-><\/span>pack_use_max_size)<\/span>
\n {<\/span>
\n min_buf_len =<\/span> sizeof<\/span>(<\/span>unsigned<\/span> short<\/span> int<\/span>)<\/span>*<\/span>3<\/span>;<\/span>
\n }<\/span>
\n if<\/span> (<\/span>length<<\/span>min_buf_len)<\/span>
\n {<\/span>
\n return<\/span> 0<\/span>;<\/span>
\n }<\/span>
\n if<\/span> (<\/span>isNullOrEmpty<\/span>(<\/span>self)<\/span>)<\/span>
\n {<\/span>
\n return<\/span> 0<\/span>;<\/span>
\n }<\/span>
\n \/\/ \u4e3a\u603b\u5927\u5c0f\u817e\u51fa\u7a7a\u95f4<\/span>
\n used+=<\/span>sizeof<\/span>(<\/span>unsigned<\/span> short<\/span> int<\/span>)<\/span>;<\/span>
\n if<\/span> (<\/span>self-><\/span>pack_use_max_size)<\/span>
\n {<\/span>
\n \/\/\u5982\u679c\u542f\u7528\u6700\u5927\u5927\u5c0f,\u5219\u4e3a\u6700\u5927\u5927\u5c0f\u817e\u51fa\u7a7a\u95f4<\/span>
\n used+=<\/span>sizeof<\/span>(<\/span>unsigned<\/span> short<\/span> int<\/span>)<\/span>;<\/span>
\n }<\/span>
\n \/\/\u518d\u5faa\u73af\u5199\u5165\u6bcf\u4e2a\u5143\u7d20<\/span>
\n while<\/span>(<\/span>obj=<\/span>self-><\/span>slice<\/span>(<\/span>self,<\/span>self-><\/span>__lastPacked++<\/span>)<\/span>)<\/span>{<\/span>
\n size =<\/span> sizefun<\/span>(<\/span>obj,<\/span>max_size,<\/span>self-><\/span>__lastPacked–<\/span>1<\/span>)<\/span>;<\/span>
\n if<\/span> (<\/span>self-><\/span>pack_use_max_size)<\/span>
\n {<\/span>
\n max_size =<\/span> max_size<<\/span>size?<\/span>size:<\/span>max_size;<\/span>
\n }<\/span>
\n \/\/\u9700\u8981\u5199\u5165\u7684\u5b57\u8282\u6570\u4e3asize+sizeof（unsigned short int）<\/span>
\n \/\/\u5982\u679c\u5199\u5165\u91cf\u8d85\u8fc7\u957f\u5ea6，\u5219\u8fd4\u56de\u5b9e\u9645\u4f7f\u7528\u91cf；<\/span>
\n if<\/span> (<\/span>used+<\/span>size+<\/span>sizeof<\/span>(<\/span>unsigned<\/span> short<\/span> int<\/span>)<\/span>><\/span>length)<\/span>
\n {<\/span>
\n *<\/span>(<\/span>unsigned<\/span> short<\/span> int<\/span> *<\/span>)<\/span>(<\/span>buf)<\/span> =<\/span>used;<\/span>
\n if<\/span> (<\/span>self-><\/span>pack_use_max_size)<\/span>
\n {<\/span>
\n *<\/span>(<\/span>unsigned<\/span> short<\/span> int<\/span> *<\/span>)<\/span>(<\/span>buf+<\/span>sizeof<\/span>(<\/span>unsigned<\/span> short<\/span> int<\/span>)<\/span>)<\/span> =<\/span>max_size;<\/span>
\n }<\/span>
\n self-><\/span>__lastPacked—<\/span>;<\/span>\/\/\u56de\u9000\u8ba1\u6570\u5668<\/span>
\n return<\/span> used;<\/span>\/\/\u672a\u6253\u5305\u5b8c,\u8fd4\u56de\u4f7f\u7528\u91cf<\/span>
\n }<\/span>
\n \/\/\u5426\u5219\u5219\u5199\u5165\u5927\u5c0f\u548c\u6570\u636e<\/span>
\n *<\/span>(<\/span>unsigned<\/span> short<\/span> int<\/span> *<\/span>)<\/span>(<\/span>buf+<\/span>used)<\/span> =<\/span>size;<\/span>
\n used+=<\/span>sizeof<\/span>(<\/span>unsigned<\/span> short<\/span> int<\/span>)<\/span>;<\/span>
\n memcpy<\/span>(<\/span>buf+<\/span>used,<\/span>obj,<\/span>size)<\/span>;<\/span>
\n used+=<\/span>size;<\/span>
\n }<\/span>
\n self-><\/span>__lastPacked =<\/span> 0<\/span>;<\/span>\/\/\u8fd9\u91cc\u8bf4\u660e\u6253\u5305\u5b8c\u4e86<\/span>
\n *<\/span>(<\/span>unsigned<\/span> short<\/span> int<\/span> *<\/span>)<\/span>(<\/span>buf)<\/span> =<\/span>used;<\/span>
\n if<\/span> (<\/span>self-><\/span>pack_use_max_size)<\/span>
\n {<\/span>
\n *<\/span>(<\/span>unsigned<\/span> short<\/span> int<\/span> *<\/span>)<\/span>(<\/span>buf+<\/span>sizeof<\/span>(<\/span>unsigned<\/span> short<\/span> int<\/span>)<\/span>)<\/span> =<\/span>max_size;<\/span>
\n }<\/span>
\n self-><\/span>packed=<\/span>1<\/span>;<\/span>
\n return<\/span> used;<\/span>
\n}<\/span>
\nmyListOP*<\/span> myListDUnpack<\/span>(<\/span>char<\/span> pack_use_max_size,<\/span>char<\/span>*<\/span> buf,<\/span>void<\/span>(<\/span>*<\/span>printData)<\/span>(<\/span>void<\/span>*<\/span>)<\/span>)<\/span>{<\/span>
\n unsigned<\/span> int<\/span> total =<\/span> *<\/span>(<\/span>unsigned<\/span> short<\/span> int<\/span> *<\/span>)<\/span>buf;<\/span>\/\/\u534f\u8bae\u5305\u7684\u603b\u5927\u5c0f<\/span>
\n if<\/span> (<\/span>total<<\/span>2<\/span>*<\/span>sizeof<\/span>(<\/span>unsigned<\/span> short<\/span> int<\/span>)<\/span>+<\/span>1<\/span>)<\/span>\/\/\u5982\u679c\u6bd4\u6700\u5c0f\u7684\u60c5\u51b5\u8fd8\u5c0f(\u4e00\u4e2a\u603b\u5927\u5c0f,\u4e00\u4e2a\u5bf9\u8c61,\u5bf9\u8c61\u53ea\u5199\u5165\u4e86\u4e00\u4e2a\u5b57\u8282)<\/span>
\n {<\/span>
\n return<\/span> 0<\/span>;<\/span>
\n }<\/span><\/p>\n

unsigned<\/span> int<\/span> delta=<\/span>sizeof<\/span>(<\/span>unsigned<\/span> short<\/span> int<\/span>)<\/span>;<\/span>\/\/\u504f\u79fb\u91cf,\u5934\u4e24\u4e2a\u5b57\u8282\u662f\u534f\u8bae\u5305\u5927\u5c0f<\/span>
\n unsigned<\/span> int<\/span> num =<\/span>0<\/span>;<\/span>\/\/\u603b\u5143\u7d20\u6570\u91cf<\/span>
\n unsigned<\/span> int<\/span> maxSize =<\/span> *<\/span>(<\/span>unsigned<\/span> short<\/span> int<\/span> *<\/span>)<\/span>(<\/span>buf+<\/span>delta)<\/span>;<\/span>\/\/\u6700\u5927\u5143\u7d20\u7684\u5927\u5c0f,\u5047\u8bbe\u7b2c\u4e00\u4e2a\u6700\u5927<\/span>
\n unsigned<\/span> int<\/span> currentSize=<\/span>0<\/span>;<\/span><\/p>\n

\/\/\u627e\u5230\u8981\u7533\u8bf7\u7684\u5730\u5740\u7684\u5927\u5c0f<\/span>
\n if<\/span> (<\/span>pack_use_max_size)<\/span>
\n {<\/span>
\n maxSize =<\/span> *<\/span>(<\/span>unsigned<\/span> short<\/span> int<\/span> *<\/span>)<\/span>(<\/span>buf+<\/span>sizeof<\/span>(<\/span>unsigned<\/span> short<\/span> int<\/span>)<\/span>)<\/span>;<\/span>
\n delta+=<\/span>sizeof<\/span>(<\/span>unsigned<\/span> short<\/span> int<\/span>)<\/span>;<\/span>
\n }<\/span><\/p>\n

\/\/ \u5148\u83b7\u53d6\u6700\u5927\u7684\u5927\u5c0f<\/span>
\n while<\/span> (<\/span>delta<<\/span>total)<\/span>\/\/\u4e0d\u4f1a\u51fa\u73b0\u7b49\u4e8e,\u6700\u5c11\u4f1a\u5199\u51651\u5b57\u8282\u7684obj<\/span>
\n {<\/span>
\n num=<\/span>num+<\/span>1<\/span>;<\/span>
\n currentSize =<\/span> *<\/span>(<\/span>unsigned<\/span> short<\/span> int<\/span> *<\/span>)<\/span>(<\/span>buf+<\/span>delta)<\/span>;<\/span>
\n if<\/span> (<\/span>maxSize<<\/span>currentSize)<\/span>
\n {<\/span>
\n maxSize =<\/span> currentSize;<\/span>
\n }<\/span>
\n delta+=<\/span>currentSize+<\/span>sizeof<\/span>(<\/span>unsigned<\/span> short<\/span> int<\/span>)<\/span>;<\/span>
\n }<\/span><\/p>\n

delta =<\/span> sizeof<\/span>(<\/span>unsigned<\/span> short<\/span> int<\/span>)<\/span>;<\/span>
\n if<\/span> (<\/span>pack_use_max_size)<\/span>
\n {<\/span>
\n delta+=<\/span>sizeof<\/span>(<\/span>unsigned<\/span> short<\/span> int<\/span>)<\/span>;<\/span>
\n }<\/span><\/p>\n

\/\/\u518d\u7533\u8bf7\u5185\u5b58<\/span>
\n myListOP*<\/span> arr =<\/span> myListDInit<\/span>(<\/span>printData)<\/span>;<\/span>if<\/span> (<\/span>arr ==<\/span> 0<\/span>)<\/span>{<\/span>return<\/span> 0<\/span>;<\/span>}<\/span>
\n arr-><\/span>pack_use_max_size=<\/span>pack_use_max_size;<\/span>\/\/\u7ee7\u627f\u539f\u6709\u7684\u683c\u5f0f<\/span>
\n while<\/span> (<\/span>delta<<\/span>total)<\/span>\/\/\u4e0d\u4f1a\u51fa\u73b0\u7b49\u4e8e,\u6700\u5c11\u4f1a\u5199\u51651\u5b57\u8282\u7684obj<\/span>
\n {<\/span>
\n void<\/span>*<\/span> obj=<\/span>malloc<\/span>(<\/span>maxSize)<\/span>;<\/span>if<\/span> (<\/span>obj ==<\/span> 0<\/span>)<\/span>{<\/span>return<\/span> 0<\/span>;<\/span>}<\/span>
\n currentSize =<\/span> *<\/span>(<\/span>unsigned<\/span> short<\/span> int<\/span> *<\/span>)<\/span>(<\/span>buf+<\/span>delta)<\/span>;<\/span>
\n delta+=<\/span>sizeof<\/span>(<\/span>unsigned<\/span> short<\/span> int<\/span>)<\/span>;<\/span>
\n memset<\/span>(<\/span>obj,<\/span>*<\/span>(<\/span>char<\/span>*<\/span>)<\/span>(<\/span>buf+<\/span>delta+<\/span>currentSize–<\/span>1<\/span>)<\/span>,<\/span>maxSize)<\/span>;<\/span>\/\/\u4ee5\u6700\u540e\u4e00\u4e2a\u5b57\u8282\u521d\u59cb\u5316<\/span>
\n memcpy<\/span>(<\/span>obj,<\/span>buf+<\/span>delta,<\/span>currentSize)<\/span>;<\/span>
\n delta+=<\/span>currentSize;<\/span>
\n arr-><\/span>append<\/span>(<\/span>arr,<\/span>obj)<\/span>;<\/span>\/\/\u5bf9\u94fe\u8868,\u5b58\u7684\u662f\u5bf9\u8c61\u7684\u5730\u5740<\/span>
\n }<\/span>
\n return<\/span> arr;<\/span>
\n}<\/span>
\nstatic<\/span> myListOP*<\/span> unpack<\/span>(<\/span>myListOP*<\/span> self,<\/span>char<\/span>*<\/span> buf,<\/span>void<\/span>(<\/span>*<\/span>printData)<\/span>(<\/span>void<\/span>*<\/span>)<\/span>)<\/span>{<\/span>
\n \/\/\u517c\u5bb9\u5c42<\/span>
\n return<\/span> myListDUnpack<\/span>(<\/span>self-><\/span>pack_use_max_size,<\/span>buf,<\/span>printData)<\/span>;<\/span>
\n}<\/span>
\nstatic<\/span> int<\/span> delByAddrNoFree<\/span>(<\/span>myListOP *<\/span>self,<\/span>void<\/span>*<\/span> obj,<\/span>unsigned<\/span> int<\/span> times)<\/span>{<\/span>
\n if<\/span> (<\/span>self==<\/span>0<\/span>||<\/span>self-><\/span>isNullOrEmpty<\/span>(<\/span>self)<\/span>||<\/span>obj==<\/span>0<\/span>)<\/span>
\n {<\/span>
\n return<\/span> 0<\/span>;<\/span>
\n }<\/span>
\n do<\/span>
\n {<\/span>
\n unsigned<\/span> int<\/span> where =<\/span> self-><\/span>find<\/span>(<\/span>self,<\/span>obj,<\/span>times)<\/span>;<\/span>
\n if<\/span> (<\/span>where ==<\/span> –<\/span>1<\/span>)<\/span>
\n {<\/span>
\n break<\/span>;<\/span>
\n }<\/span>
\n self-><\/span>delNoFree<\/span>(<\/span>self,<\/span>where)<\/span>;<\/span>
\n }<\/span> while<\/span> (<\/span>times—<\/span>)<\/span>;<\/span>
\n return<\/span> times;<\/span>
\n}<\/span><\/p>\n

static<\/span> int<\/span> delByAddr<\/span>(<\/span>myListOP *<\/span>self,<\/span>void<\/span>*<\/span> obj,<\/span>unsigned<\/span> int<\/span> times)<\/span>{<\/span>
\n if<\/span> (<\/span>self==<\/span>0<\/span>||<\/span>self-><\/span>isNullOrEmpty<\/span>(<\/span>self)<\/span>||<\/span>obj==<\/span>0<\/span>)<\/span>
\n {<\/span>
\n return<\/span> 0<\/span>;<\/span>
\n }<\/span>
\n do<\/span>
\n {<\/span>
\n unsigned<\/span> int<\/span> where =<\/span> self-><\/span>find<\/span>(<\/span>self,<\/span>obj,<\/span>times)<\/span>;<\/span>
\n if<\/span> (<\/span>where ==<\/span> –<\/span>1<\/span>)<\/span>
\n {<\/span>
\n break<\/span>;<\/span>
\n }<\/span>
\n self-><\/span>del<\/span>(<\/span>self,<\/span>where)<\/span>;<\/span>
\n }<\/span> while<\/span> (<\/span>times—<\/span>)<\/span>;<\/span>
\n return<\/span> times;<\/span>
\n}<\/span><\/p>\n

static<\/span> int<\/span> add<\/span>(<\/span>myListOP *<\/span>self,<\/span>myListOP *<\/span>other)<\/span>{<\/span>
\n void<\/span>*<\/span> obj =<\/span>0<\/span>;<\/span>
\n unsigned<\/span> int<\/span> i =<\/span>0<\/span>;<\/span>
\n while<\/span> (<\/span>obj=<\/span>other-><\/span>slice<\/span>(<\/span>other,<\/span>i++<\/span>)<\/span>)<\/span>
\n {<\/span>
\n self-><\/span>append<\/span>(<\/span>self,<\/span>obj)<\/span>;<\/span>
\n }<\/span>
\n}<\/span><\/p>\n

static<\/span> int<\/span> sub<\/span>(<\/span>myListOP *<\/span>self,<\/span>myListOP *<\/span>other)<\/span>{<\/span>
\n int<\/span> ret =<\/span>0<\/span>;<\/span>
\n if<\/span> (<\/span>self ==<\/span>0<\/span>||<\/span>other ==<\/span>0<\/span>)<\/span>
\n {<\/span>
\n return<\/span> ret;<\/span>
\n }<\/span>
\n if<\/span> (<\/span>self-><\/span>isNullOrEmpty<\/span>(<\/span>self)<\/span>||<\/span>other-><\/span>isNullOrEmpty<\/span>(<\/span>other)<\/span>)<\/span>
\n {<\/span>
\n return<\/span> ret;<\/span>
\n }<\/span>
\n void<\/span>*<\/span> obj_self =<\/span>0<\/span>;<\/span>
\n void<\/span>*<\/span> obj_other=<\/span>0<\/span>;<\/span>
\n unsigned<\/span> int<\/span> i =<\/span>0<\/span>;<\/span>
\n unsigned<\/span> int<\/span> j=<\/span>0<\/span>;<\/span><\/p>\n

while<\/span> (<\/span>obj_other=<\/span>other-><\/span>slice<\/span>(<\/span>other,<\/span>i++<\/span>)<\/span>)<\/span>
\n {<\/span>
\n while<\/span> (<\/span>obj_self=<\/span>self-><\/span>slice<\/span>(<\/span>self,<\/span>j++<\/span>)<\/span>)<\/span>
\n {<\/span>
\n if<\/span> (<\/span>obj_other==<\/span>obj_self)<\/span>
\n {<\/span>
\n self-><\/span>delByAddr<\/span>(<\/span>self,<\/span>obj_self,<\/span>0<\/span>)<\/span>;<\/span>
\n }<\/span>
\n }<\/span>
\n }<\/span>
\n}<\/span>
\nmyListOP*<\/span> myListDInit<\/span>(<\/span>void<\/span>(<\/span>*<\/span>printData)<\/span>(<\/span>void<\/span>*<\/span>)<\/span>)<\/span>{<\/span>
\n myListOP *<\/span>self =<\/span> (<\/span>myListOP *<\/span>)<\/span> malloc<\/span>(<\/span>sizeof<\/span>(<\/span>myListOP)<\/span>)<\/span>;<\/span>
\n if<\/span> (<\/span>self ==<\/span>0<\/span>)<\/span>
\n {<\/span>
\n return<\/span> 0<\/span>;<\/span>
\n }<\/span>
\n bzero<\/span>(<\/span>self,<\/span>sizeof<\/span>(<\/span>myListOP)<\/span>)<\/span>;<\/span>
\n \/\/\u7533\u8bf7\u5934\u8282\u70b9<\/span>
\n self-><\/span>data =<\/span> (<\/span>myListP)<\/span> malloc<\/span>(<\/span>sizeof<\/span>(<\/span>myList)<\/span>)<\/span>;<\/span>
\n if<\/span> (<\/span>self-><\/span>data ==<\/span>0<\/span>)<\/span>
\n {<\/span>
\n return<\/span> 0<\/span>;<\/span>
\n }<\/span>
\n self-><\/span>data-><\/span>data=<\/span>0<\/span>;<\/span>
\n self-><\/span>data-><\/span>next=<\/span>self-><\/span>data;<\/span>
\n self-><\/span>data-><\/span>prev=<\/span>self-><\/span>data;<\/span>
\n self-><\/span>append=<\/span>append;<\/span>
\n self-><\/span>del=<\/span>delAll;<\/span>
\n self-><\/span>delNoFree =<\/span> del;<\/span>
\n self-><\/span>__str=<\/span>printData;<\/span>
\n self-><\/span>destory=<\/span>destory;<\/span>
\n self-><\/span>find=<\/span>find;<\/span>
\n self-><\/span>findby=<\/span>findby;<\/span>
\n self-><\/span>insert=<\/span>insert;<\/span>
\n self-><\/span>isNullOrEmpty=<\/span>isNullOrEmpty;<\/span>
\n self-><\/span>length=<\/span>0<\/span>;<\/span>
\n self-><\/span>slice=<\/span>_slice;<\/span>
\n self-><\/span>_slice=<\/span>slice;<\/span>
\n self-><\/span>unic=<\/span>unic;<\/span>
\n self-><\/span>print=<\/span>print;<\/span>
\n self-><\/span>dequeue=<\/span>dequeue;<\/span>
\n self-><\/span>pop=<\/span>pop;<\/span>
\n self-><\/span>push=<\/span>(<\/span>int<\/span> (<\/span>*<\/span>)<\/span>(<\/span>struct<\/span> myListOP<\/span>*<\/span>,<\/span>void<\/span>*<\/span> data)<\/span>)<\/span>append;<\/span>
\n self-><\/span>queue=<\/span>(<\/span>int<\/span> (<\/span>*<\/span>)<\/span>(<\/span>struct<\/span> myListOP<\/span>*<\/span>,<\/span>void<\/span>*<\/span> data)<\/span>)<\/span>append;<\/span>
\n self-><\/span>quickSort=<\/span>quickSort;<\/span>
\n self-><\/span>_quickSort=<\/span>_quickSort;<\/span>
\n self-><\/span>destoryNoFree=<\/span>destoryNoFree;<\/span>
\n self-><\/span>unicNoFree=<\/span>unicNoFree;<\/span>
\n self-><\/span>packVarLength=<\/span>packVarLength;<\/span>
\n self-><\/span>pack=<\/span>pack;<\/span>
\n self-><\/span>unpack=<\/span>unpack;<\/span>
\n self-><\/span>delByAddr =<\/span> delByAddr;<\/span><\/p>\n

return<\/span> self;<\/span>
\n}<\/span><\/p>\n

doublyList.h<\/p>\n

#<\/span>ifndef<\/span> __MYDOUBLYLIST_STRUCT__<\/span><\/span>
\n#<\/span>define<\/span> __MYDOUBLYLIST_STRUCT__<\/span><\/span><\/p>\n

\/* \u53cc\u5411\u5faa\u73af\u94fe\u8868,\u6db5\u76d6\u64cd\u4f5c\u7c7b
\n*
\n* \u7528\u6cd5: \u9700\u8981\u5916\u90e8\u521b\u5efa\u7ed3\u6784\u4f53\u6216\u5bf9\u8c61,\u540c\u65f6\u51c6\u5907\u597d\u8be5\u7ed3\u6784\u4f53\u6216\u5bf9\u8c61\u7684\u6253\u5370(print)\u65b9\u6cd5
\n* \u8bf7\u6ce8\u610f:\u957f\u5ea6\u4ece0\u5f00\u59cb,\u5230length\u7ed3\u675f
\n* \u63a8\u8350\u4ee5\u4ee5\u4e0b\u65b9\u5f0f\u8fed\u4ee3\u94fe\u8868
\n* while(obj=.slice(,i++))
\n* \u4ee5\u4e0b\u5212\u7ebf(_)\u5f00\u5934\u7684\u65b9\u6cd5\u4e3a\u67d0\u4e00\u65b9\u6cd5\u7684\u8865\u5145,\u6216\u662f\u4f4e\u7ea7\u5b9e\u73b0,\u7406\u60f3\u60c5\u51b5\u4e0b\u4e0d\u5e94\u5f53\u88ab\u4f7f\u7528
\n* \u4ee5\u4e0b\u5212\u7ebf(__)\u5f00\u5934\u7684\u5b57\u6bb5\u4e3a\u5185\u90e8\u5b9e\u73b0\u4f9d\u8d56\u7684\u5b57\u6bb5,\u4e0d\u5e94\u5f53\u88ab\u5916\u754c\u6539\u53d8
\n* \u5728\u6570\u7ec4\u7684\u5b9e\u73b0\u4e2d,\u90e8\u5206\u65b9\u6cd5\u4f9d\u8d56\u4e8e\u957f\u5ea6(.length),\u5176\u957f\u5ea6\u4e0d\u5e94\u5f53\u88ab\u6539\u53d8
\n* \u4ee5\u4e0b\u64cd\u4f5c\u662f\u5408\u6cd5\u7684
\n* _slice(0),_slice(length),_slice(-1),_slice(length+1)\u8fd4\u56de\u503c\u5206\u522b\u4e3a\u5934\u6570\u636e,\u5c3e\u6570\u636e,0,0
\n* slice(1),slice(length),\u8fd4\u56de\u503c\u5206\u522b\u4e3a\u5934\u5c3e\u8282\u70b9\u5185\u5b58\u7684\u5bf9\u8c61.
\n* \u540c\u4e00\u4e2a\u94fe\u8868\u64cd\u4f5c\u7c7b\u64cd\u4f5c\u4e0d\u540c\u7684\u94fe\u8868 \u5373op1->fun(op2,agrs) \u8be5\u7ed3\u679c\u5e94\u8be5\u4e0e op2->fun(op2,agrs) \u4e00\u81f4,\u4f46\u65e0\u6cd5\u4fdd\u8bc1\u8de8\u94fe\u8868\u64cd\u4f5c\u7c7b\u7ed3\u679c\u4e00\u81f4<\/p>\n

* \u5982\u9700\u6392\u5e8f\/\u53bb\u91cd\/\u6309\u5b57\u6bb5\u67e5\u627e,\u5219\u9700\u51c6\u5907\u5b57\u6bb5\u7684\u65b9\u6cd5
\n* \u5982\u9700\u6392\u5e8f,\u9700\u8981\u63d0\u4f9b\u6bd4\u8f83\u65b9\u6cd5
\n*
\n* \u521d\u59cb myListOP* mylistOP = myListDInit((void(*)(void*))printData);
\n* 2025\/5\/9 \u4fee\u6539\u8fd4\u56devoid* \u7684slice\u53ef\u80fd\u6bb5\u9519\u8bef\u7684\u95ee\u9898
\n* 2025\/5\/10 \u4fee\u8865\u7f16\u8bd1\u5668\u63d0\u793a,\u589e\u52a0unicNoFree,\u589e\u52a0pack\u4e0eunpack
\n* 2025\/5\/11 \u8865\u5145\u6d4b\u8bd5\u51fd\u6570,\u653e\u5f03\u5bf9\u5355\u5411\u94fe\u8868\u7684\u652f\u6301,\u91cd\u547d\u540d\u65b0\u589eNoFree\u51fd\u6570
\n*\/<\/span>
\ntypedef<\/span> struct<\/span> myList<\/span>{<\/span><\/p>\n

void<\/span> *<\/span> data;<\/span>
\n struct<\/span> myList<\/span> *<\/span> prev;<\/span>
\n struct<\/span> myList<\/span> *<\/span> next;<\/span>
\n}<\/span>myList,<\/span>*<\/span> myListP;<\/span><\/p>\n

typedef<\/span> struct<\/span> myListOP<\/span>{<\/span>
\n myListP data;<\/span>
\n \/\/\u5224\u65ad\u94fe\u662f\u5426\u4e3a\u7a7a,\u7a7a\u8fd4\u56de1,\u975e\u7a7a\u8fd4\u56de0<\/span>
\n int<\/span> (<\/span>*<\/span>isNullOrEmpty)<\/span>(<\/span>struct<\/span> myListOP<\/span>*<\/span>)<\/span>;<\/span>
\n \/\/\u5c06obj\u5b58\u653e\u5165\u94fe\u8868\u7684\u5c3e\u90e8,\u6210\u529f\u8fd4\u56de1,\u5931\u8d25\u8fd4\u56de0<\/span>
\n int<\/span> (<\/span>*<\/span>append)<\/span>(<\/span>struct<\/span> myListOP<\/span>*<\/span>,<\/span>void<\/span>*<\/span> data)<\/span>;<\/span>
\n \/*
\n \u5220\u9664\u94fe\u8868\u4e0a\u7684\u7b2cwhere\u4e2a\u8282\u70b9,\u4f1a\u81ea\u52a8free\u8be5\u8282\u70b9\u6307\u5411\u7684\u5bf9\u8c61
\n returnVal: 0\u5931\u8d25,1\u6210\u529f
\n *\/<\/span>
\n int<\/span> (<\/span>*<\/span>del)<\/span>(<\/span>struct<\/span> myListOP<\/span>*<\/span>,<\/span>unsigned<\/span> int<\/span> where)<\/span>;<\/span>
\n \/*
\n \u5220\u9664\u94fe\u8868\u4e0a\u7684\u7b2cwhere\u4e2a\u8282\u70b9,\u4f1a\u81ea\u52a8free\u8be5\u8282\u70b9\u6307\u5411\u7684\u5bf9\u8c61
\n returnVal: \u8be5\u8282\u70b9\u6307\u5411\u7684\u5bf9\u8c61\u7684\u5730\u5740
\n *\/<\/span>
\n void<\/span>*<\/span> (<\/span>*<\/span>delNoFree)<\/span>(<\/span>struct<\/span> myListOP<\/span>*<\/span>,<\/span>unsigned<\/span> int<\/span> where)<\/span>;<\/span>
\n \/*
\n \u5728where\u5904\u63d2\u5165obj\u5bf9\u8c61
\n returnVal: 0\u5931\u8d25,1\u6210\u529f
\n *\/<\/span>
\n int<\/span> (<\/span>*<\/span>insert)<\/span>(<\/span>struct<\/span> myListOP<\/span>*<\/span>,<\/span>unsigned<\/span> int<\/span> where,<\/span>void<\/span>*<\/span> obj)<\/span>;<\/span>
\n \/*
\n \u67e5\u627e\u8be5\u5bf9\u8c61times+1\u6b21,\u8fd4\u56detimes+1\u6b21\u6240\u5bf9\u5e94\u7684\u4e0b\u6807,times\u4e3a0\u8868\u793a\u53d6\u7b2c\u4e00\u4e2a
\n returnVal: where,-1\u8868\u793a\u672a\u627e\u5230\u8be5\u5bf9\u8c61
\n *\/<\/span>
\n unsigned<\/span> int<\/span> (<\/span>*<\/span>find)<\/span>(<\/span>struct<\/span> myListOP<\/span>*<\/span>self,<\/span>void<\/span>*<\/span> obj,<\/span>unsigned<\/span> int<\/span> times)<\/span>;<\/span>
\n \/*
\n \u5728\u94fe\u8868\u4e0a\u4fdd\u8bc1\u94fe\u8868\u4e0a\u67d0\u4e2a\u5bf9\u8c61\u6700\u591a\u4e0d\u51fa\u73b0time+1\u6b21,\u4f1afree\u5bf9\u8c61
\n field:\u53d6\u5b57\u6bb5\u51fd\u6570,\u63a5\u53d7\u94fe\u8868\u5185\u5b58\u50a8\u7684\u5bf9\u8c61,\u8fd4\u56de\u8981\u6392\u5e8f\u7684\u5b57\u6bb5\u7684\u5730\u5740
\n size:\u8be5\u5b57\u6bb5\u7684\u5927\u5c0f
\n \u5177\u4f53\u8c03\u7528:memcmp(field(slice(self,i)->data),field(slice(self,j)->data),size)==0
\n returnVal:\u5220\u9664\u4e86\u51e0\u4e2a\u5bf9\u8c61
\n *\/<\/span>
\n unsigned<\/span> int<\/span> (<\/span>*<\/span>unic)<\/span>(<\/span>struct<\/span> myListOP<\/span>*<\/span>self,<\/span>void<\/span>*<\/span>(<\/span>*<\/span>field)<\/span>(<\/span>void<\/span>*<\/span>)<\/span>,<\/span>long<\/span> unsigned<\/span> int<\/span> size,<\/span>unsigned<\/span> int<\/span> times)<\/span>;<\/span>
\n \/*
\n \u5728\u94fe\u8868\u4e0a\u4fdd\u8bc1\u94fe\u8868\u4e0a\u67d0\u4e2a\u5bf9\u8c61\u6700\u591a\u4e0d\u51fa\u73b0time+1\u6b21,\u4e0d\u4f1afree\u5bf9\u8c61
\n field:\u53d6\u5b57\u6bb5\u51fd\u6570,\u63a5\u53d7\u94fe\u8868\u5185\u5b58\u50a8\u7684\u5bf9\u8c61,\u8fd4\u56de\u8981\u6392\u5e8f\u7684\u5b57\u6bb5\u7684\u5730\u5740
\n size:\u8be5\u5b57\u6bb5\u7684\u5927\u5c0f
\n \u5177\u4f53\u8c03\u7528:memcmp(field(slice(self,i)->data),field(slice(self,j)->data),size)==0
\n returnVal:\u5220\u9664\u4e86\u51e0\u4e2a\u5bf9\u8c61
\n *\/<\/span>
\n unsigned<\/span> int<\/span> (<\/span>*<\/span>unicNoFree)<\/span>(<\/span>struct<\/span> myListOP<\/span>*<\/span>self,<\/span>void<\/span>*<\/span>(<\/span>*<\/span>field)<\/span>(<\/span>void<\/span>*<\/span>)<\/span>,<\/span>long<\/span> unsigned<\/span> int<\/span> size,<\/span>unsigned<\/span> int<\/span> times)<\/span>;<\/span>
\n \/*
\n \u8fd4\u56de\u94fe\u8868\u5185\u7b2ci\u4e2a\u94fe\u7684\u5730\u5740,\u4e0d\u5e94\u5f53\u88ab\u5916\u90e8\u8c03\u7528
\n *\/<\/span>
\n myList*<\/span> (<\/span>*<\/span>_slice)<\/span>(<\/span>struct<\/span> myListOP<\/span>*<\/span> self,<\/span>unsigned<\/span> int<\/span> i)<\/span>;<\/span>
\n \/*
\n \u8fd4\u56de\u94fe\u8868\u5185\u7b2ci\u4e2a\u5bf9\u8c61\u7684\u5730\u5740
\n \u5e94\u8be5\u88ab\u8fd9\u4e48\u7528:
\n while(obj=op->slice(op,i++)){
\n do something to op
\n }
\n *\/<\/span>
\n void<\/span>*<\/span> (<\/span>*<\/span>slice)<\/span>(<\/span>struct<\/span> myListOP<\/span>*<\/span> self,<\/span>unsigned<\/span> int<\/span> i)<\/span>;<\/span>
\n \/\/ \u9500\u6bc1\u94fe\u8868,\u5e76\u4e14\u9500\u6bc1\u94fe\u8868\u5185\u7684\u6240\u6709\u5bf9\u8c61(free obj)<\/span>
\n void<\/span> (<\/span>*<\/span>destory)<\/span>(<\/span>struct<\/span> myListOP<\/span> *<\/span>self)<\/span>;<\/span>
\n \/\/ \u5c06\u94fe\u8868\u5185\u7684\u6240\u6709\u5bf9\u8c61\u6328\u4e2a\u4f20\u7ed9.__str\u65b9\u6cd5,.__str\u65b9\u6cd5\u5e94\u5f53\u5728\u521d\u59cb\u5316\u65f6\u88ab\u6b63\u786e\u8bbe\u7f6e\u4e3a\u63a5\u53d7\u5bf9\u8c61\u7684\u5730\u5740\u5e76\u8fdb\u884c\u8f93\u51fa<\/span>
\n void<\/span> (<\/span>*<\/span>print)<\/span>(<\/span>struct<\/span> myListOP<\/span> *<\/span> self)<\/span>;<\/span>
\n \/*
\n field:\u53d6\u5b57\u6bb5\u51fd\u6570,\u63a5\u53d7\u94fe\u8868\u5185\u5b58\u50a8\u7684\u5bf9\u8c61,\u8fd4\u56de\u8981\u6392\u5e8f\u7684\u5b57\u6bb5\u7684\u5730\u5740
\n cmp: \u6bd4\u8f83\u51fd\u6570,\u63a5\u6536target,\u63a5\u53d7\u7531field\u4ea7\u751f\u7684\u5b57\u6bb5\u7684\u5730\u5740,\u8fd4\u56de\u4e24\u4e2a\u503c\u7684\u5dee\u503c(cmp(filed(p->data),target))
\n target:\u8981\u6bd4\u8f83\u7684\u503c\u7684\u5730\u5740
\n times:\u627e\u7b2ctimes+1\u4e2a
\n returnVal:\u627e\u5230\u8fd4\u56dewhere,\u6ca1\u627e\u5230\u8fd4\u56de-1
\n *\/<\/span>
\n unsigned<\/span> int<\/span> (<\/span>*<\/span>findby)<\/span>(<\/span>struct<\/span> myListOP<\/span>*<\/span>self,<\/span>int<\/span>(<\/span>*<\/span>cmp)<\/span>(<\/span>void<\/span>*<\/span>,<\/span>void<\/span>*<\/span>)<\/span>,<\/span>void<\/span>*<\/span>(<\/span>*<\/span>field)<\/span>(<\/span>void<\/span>*<\/span>)<\/span>,<\/span>void<\/span>*<\/span>target,<\/span>unsigned<\/span> int<\/span> times)<\/span>;<\/span>
\n \/\/.print\u4f1a\u8c03\u7528\u8fd9\u4e2a\u65b9\u6cd5\u8f93\u51fa\u94fe\u8868\u5185\u7684\u5bf9\u8c61(\u4f1a\u5c06\u6bcf\u4e00\u4e2a\u5bf9\u8c61\u7684\u5730\u5740\u8f93\u5165\u8fdb\u8fd9\u4e2a\u65b9\u6cd5)<\/span>
\n void<\/span> (<\/span>*<\/span>__str)<\/span>(<\/span>void<\/span>*<\/span>)<\/span>;<\/span>
\n \/\/\u5220\u9664\u94fe\u8868\u7684\u7b2c\u4e00\u4e2a\u8282\u70b9,\u5c06\u5176\u5185\u90e8\u5b58\u653e\u7684\u5bf9\u8c61\u7684\u5730\u5740\u8fd4\u56de(\u800c\u4e0d\u662ffree)<\/span>
\n void<\/span>*<\/span> (<\/span>*<\/span>dequeue)<\/span>(<\/span>struct<\/span> myListOP<\/span>*<\/span> self)<\/span>;<\/span>
\n \/\/\u5220\u9664\u94fe\u8868\u7684\u5c3e\u8282\u70b9,\u5c06\u5176\u5185\u90e8\u5b58\u653e\u7684\u5bf9\u8c61\u7684\u5730\u5740\u8fd4\u56de(\u800c\u4e0d\u662ffree)<\/span>
\n void<\/span>*<\/span> (<\/span>*<\/span>pop)<\/span>(<\/span>struct<\/span> myListOP<\/span>*<\/span> self)<\/span>;<\/span>
\n \/\/\u5c06obj\u5b58\u653e\u5165\u94fe\u8868\u7684\u5c3e\u90e8,\u6210\u529f\u8fd4\u56de1,\u5931\u8d25\u8fd4\u56de0<\/span>
\n int<\/span> (<\/span>*<\/span>push)<\/span>(<\/span>struct<\/span> myListOP<\/span>*<\/span>,<\/span>void<\/span>*<\/span> obj)<\/span>;<\/span>
\n \/\/\u5c06obj\u5b58\u653e\u5165\u94fe\u8868\u7684\u5c3e\u90e8,\u6210\u529f\u8fd4\u56de1,\u5931\u8d25\u8fd4\u56de0<\/span>
\n int<\/span> (<\/span>*<\/span>queue)<\/span>(<\/span>struct<\/span> myListOP<\/span>*<\/span>,<\/span>void<\/span>*<\/span> data)<\/span>;<\/span>
\n \/\/\u5bf9\u94fe\u8868\u7684\u4e00\u90e8\u5206\u8fdb\u884c\u5feb\u901f\u6392\u5e8f<\/span>
\n void<\/span> (<\/span>*<\/span>_quickSort)<\/span>(<\/span>struct<\/span> myListOP<\/span>*<\/span>self,<\/span>long<\/span> int<\/span> start,<\/span>long<\/span> int<\/span> end,<\/span>int<\/span>(<\/span>*<\/span>cmp)<\/span>(<\/span>void<\/span>*<\/span>,<\/span> void<\/span>*<\/span>)<\/span>,<\/span>void<\/span>*<\/span>(<\/span>*<\/span>filed)<\/span>(<\/span>void<\/span>*<\/span>)<\/span>,<\/span>int<\/span> reverse)<\/span>;<\/span>
\n \/\/\u5bf9\u6574\u4e2a\u94fe\u8868\u5feb\u901f\u6392\u5e8f,field:\u6839\u636e\u5bf9\u8c61\u7684\u54ea\u4e2a\u5b57\u6bb5\u5730\u5740\u8fdb\u884c\u6392\u5e8f,cmp\u63a5\u53d7\u4e24\u4e2a\u5b57\u6bb5\u7684\u5730\u5740,\u8fd4\u56de\u4e24\u4e2a\u5b57\u6bb5\u503c\u7684\u5dee\u503c,reverse\u4e3a\u6b63\u5219\u6b63\u5e8f,\u4e3a\u8d1f\u5219\u5012\u53d9,0\u4e0d\u6392\u5e8f<\/span>
\n void<\/span> (<\/span>*<\/span>quickSort)<\/span>(<\/span>struct<\/span> myListOP<\/span> *<\/span>self,<\/span>int<\/span>(<\/span>*<\/span>cmp)<\/span>(<\/span>void<\/span>*<\/span>,<\/span> void<\/span>*<\/span>)<\/span>,<\/span>void<\/span>*<\/span>(<\/span>*<\/span>filed)<\/span>(<\/span>void<\/span>*<\/span>)<\/span>,<\/span>int<\/span> reverse)<\/span>;<\/span>
\n \/\/\u5220\u9664\u6574\u4e2a\u94fe\u8868,\u4f46\u4e0d\u91ca\u653e\u94fe\u8868\u4e2d\u7684\u5bf9\u8c61<\/span>
\n void<\/span> (<\/span>*<\/span>destoryNoFree)<\/span>(<\/span>struct<\/span> myListOP<\/span>*<\/span>self)<\/span>;<\/span>
\n \/\/\u6309\u5730\u5740\u5220\u9664\u67d0\u4e00\u5143\u7d20,obj\u8981\u5220\u9664\u7684\u5bf9\u8c61,times\u5220\u9664\u6b21\u6570,\u8fd4\u56de\u5b9e\u9645\u5220\u9664\u4e86\u51e0\u6b21,\u4e0d\u91ca\u653eobj<\/span>
\n int<\/span> (<\/span>*<\/span>delByAddr)<\/span>(<\/span>struct<\/span> myListOP<\/span> *<\/span>self,<\/span>void<\/span>*<\/span> obj,<\/span>unsigned<\/span> int<\/span> times)<\/span>;<\/span>
\n \/*
\n \u5c06\u5bf9\u8c61\u6253\u5305\u6210\u5b57\u8282\u6d41,\u5199\u5165\u5230buf,\u4f1a\u5220\u9664\u91cd\u590d\u7684\u5c3e\u5b57\u8282
\n \u5b57\u8282\u6d41\u683c\u5f0f：unsigened short int used（2\u5b57\u8282) unsigened short int datalen(2\u5b57\u8282) data
\n \u5982\u679c.pack_use_max_size != 0,\u5219\u5728used \u4e4b\u540e\u5199\u5165\u8be5\u5bf9\u8c61\u7684\u6700\u5927\u5927\u5c0f
\n buf:\u7f13\u51b2\u533a,\u5b57\u8282\u6d41\u5199\u5165\u7684\u5730\u5740
\n length:\u7f13\u51b2\u533abuf\u7684\u957f\u5ea6
\n max_size:\u94fe\u8868\u4e0a\u5b58\u50a8\u7684obj\u6700\u5927\u7684\u5927\u5c0f(\u5982\u5927\u5c0f\u4e0d\u4e00\u81f4,\u8bf7\u4f7f\u7528.packVarLength)
\n returnVal:\u5f80\u7f13\u51b2\u533a\u5b9e\u9645\u5199\u5165\u7684\u5b57\u8282\u6570
\n *\/<\/span>
\n unsigned<\/span> int<\/span> (<\/span>*<\/span>pack)<\/span>(<\/span>struct<\/span> myListOP<\/span> *<\/span>self,<\/span>char<\/span>*<\/span> buf,<\/span>unsigned<\/span> int<\/span> length,<\/span>unsigned<\/span> short<\/span> int<\/span> max_size)<\/span>;<\/span>
\n \/*
\n \u5c06\u5bf9\u8c61\u6253\u5305\u6210\u5b57\u8282\u6d41,\u5199\u5165\u5230buf,\u4f1a\u5220\u9664\u91cd\u590d\u7684\u5c3e\u5b57\u8282
\n \u5b57\u8282\u6d41\u683c\u5f0f：unsigened short int used（2\u5b57\u8282)unsigened short int datalen(2\u5b57\u8282) data
\n \u5982\u679c.pack_use_max_size != 0,\u5219\u5728used \u4e4b\u540e\u5199\u5165\u8be5\u5bf9\u8c61\u7684\u6700\u5927\u5927\u5c0f
\n buf:\u7f13\u51b2\u533a,\u5b57\u8282\u6d41\u5199\u5165\u7684\u5730\u5740
\n length:\u7f13\u51b2\u533abuf\u7684\u957f\u5ea6
\n size:\u53d6size\u51fd\u6570,\u4f20\u5165obj\u5bf9\u8c61,\u8fd4\u56de\u8fd9\u4e2a\u5bf9\u8c61\u5360\u7528\u4e86\u591a\u5c11\u4e2a\u5b57\u8282,obj list\u91cc\u5b58\u653e\u7684\u5bf9\u8c61,max_size:\u8fd9\u4e2a\u5bf9\u8c61\u7406\u5e94\u5360\u7684\u6700\u5927\u5b57\u8282\u6570,i,\u7b2ci\u4e2a\u5bf9\u8c61
\n \u5982\u679csize\u51fd\u6570\u8fd4\u56de\u4e86\u4e00\u4e2a\u6bd4max_size\u66f4\u5927\u7684\u6570,\u90a3\u4e48\u4ee5size\u8fd4\u56de\u7684\u6570\u636e\u7684\u6700\u5927\u503c\u4f5c\u4e3amax_size\u88ab\u5199\u5165
\n returnVal:\u5f80\u7f13\u51b2\u533a\u5b9e\u9645\u5199\u5165\u7684\u5b57\u8282\u6570
\n *\/<\/span>
\n unsigned<\/span> int<\/span> (<\/span>*<\/span>packVarLength)<\/span>(<\/span>struct<\/span> myListOP<\/span> *<\/span>self,<\/span>char<\/span>*<\/span> buf,<\/span>unsigned<\/span> int<\/span> length,<\/span>unsigned<\/span> short<\/span> (<\/span>*<\/span>size)<\/span>(<\/span>void<\/span>*<\/span> obj,<\/span>unsigned<\/span> short<\/span> int<\/span> max_size,<\/span>unsigned<\/span> int<\/span> i)<\/span>,<\/span>unsigned<\/span> short<\/span> int<\/span> max_size)<\/span>;<\/span>
\n \/*
\n \u5c06\u5b57\u8282\u6d41\u89e3\u5305\u6210\u5bf9\u8c61,\u4f1a\u5199\u5165\u5c3e\u90e8\u7684\u91cd\u590d\u5b57\u8282
\n \u5b57\u8282\u6d41\u683c\u5f0f：unsigened short int used（2\u5b57\u8282)unsigened short int datalen(2\u5b57\u8282) data
\n \u5982\u679c.pack_use_max_size != 0,\u4f7f\u7528used\u4e4b\u540e\u76842\u5b57\u8282\u4f5c\u4e3a\u6700\u5927\u957f\u5ea6\u8fdb\u884c\u521b\u5efa\u5185\u5b58
\n buf:\u7f13\u51b2\u533a,\u5b57\u8282\u6d41\u8bfb\u53d6\u7684\u5730\u5740
\n printData:\u8fd4\u56de\u64cd\u4f5c\u7c7b\u521d\u59cb\u5316\u65f6\u9700\u8981\u7684printData
\n returnVal:\u64cd\u4f5c\u7c7b
\n *\/<\/span>
\n struct<\/span> myListOP<\/span>*<\/span> (<\/span>*<\/span>unpack)<\/span>(<\/span>struct<\/span> myListOP<\/span>*<\/span> self,<\/span>char<\/span>*<\/span> buf,<\/span>void<\/span>(<\/span>*<\/span>printData)<\/span>(<\/span>void<\/span>*<\/span>)<\/span>)<\/span>;<\/span>
\n unsigned<\/span> int<\/span> length;<\/span>\/\/\u94fe\u8868\u7684\u957f\u5ea6<\/span>
\n unsigned<\/span> int<\/span> __index;<\/span>\/\/\u5185\u90e8\u53d8\u91cf,\u52a0\u901fslice\u4e0e_slice\u7684\u8fd4\u56de<\/span>
\n unsigned<\/span> int<\/span> __lastPacked;<\/span>\/\/\u5185\u90e8\u53d8\u91cf,\u8bb0\u5f55\u4e0a\u6b21\u6253\u5305\u7684\u4f4d\u7f6e<\/span>
\n char<\/span> pack_use_max_size;<\/span>\/\/\u662f\u5426\u4f7f\u7528\u6700\u5927\u7684\u5143\u7d20\u5927\u5c0f,\u4fee\u6539\u6253\u5305\u7684\u683c\u5f0f<\/span>
\n char<\/span> packed;<\/span>\/\/\u662f\u5426\u6253\u5305\u5b8c\u6bd5<\/span>
\n myListP __last;<\/span>\/\/\u5185\u90e8\u53d8\u91cf,\u52a0\u901fslice\u4e0e_slice\u7684\u8fd4\u56de<\/span>
\n myListP __head;<\/span>\/\/\u5185\u90e8\u53d8\u91cf,\u52a0\u901fslice\u4e0e_slice\u7684\u8fd4\u56de<\/span><\/p>\n

}<\/span> myListOP;<\/span>
\n\/\/\u521d\u59cb\u5316\u51fd\u6570<\/span>
\nmyListOP*<\/span> myListDInit<\/span>(<\/span>void<\/span>(<\/span>*<\/span>printData)<\/span>(<\/span>void<\/span>*<\/span>)<\/span>)<\/span>;<\/span>
\n\/*
\n\u5c06\u5b57\u8282\u6d41\u89e3\u5305\u6210\u5bf9\u8c61,\u4f1a\u5199\u5165\u5c3e\u90e8\u7684\u91cd\u590d\u5b57\u8282
\n\u5b57\u8282\u6d41\u683c\u5f0f：unsigened short int used（2\u5b57\u8282)unsigened short int datalen(2\u5b57\u8282) data
\n\u5982\u679cpack_use_max_size != 0,\u4f7f\u7528used\u4e4b\u540e\u76842\u5b57\u8282\u4f5c\u4e3a\u6700\u5927\u957f\u5ea6\u8fdb\u884c\u521b\u5efa\u5185\u5b58
\nbuf:\u7f13\u51b2\u533a,\u5b57\u8282\u6d41\u8bfb\u53d6\u7684\u5730\u5740
\nprintData:\u8fd4\u56de\u64cd\u4f5c\u7c7b\u521d\u59cb\u5316\u65f6\u9700\u8981\u7684printData
\nreturnVal:\u64cd\u4f5c\u7c7b
\n*\/<\/span>
\nmyListOP*<\/span> myListDUnpack<\/span>(<\/span>char<\/span> pack_use_max_size,<\/span>char<\/span>*<\/span> buf,<\/span>void<\/span>(<\/span>*<\/span>printData)<\/span>(<\/span>void<\/span>*<\/span>)<\/span>)<\/span>;<\/span>
\n#<\/span>endif<\/span><\/span><\/p>\n

array.c<\/p>\n

\/\/ \u5b9e\u73b0list\u7684\u5934\u63d2,\u5c3e\u63d2,\u5934\u5220,\u5c3e\u5220,\u4efb\u610f\u4f4d\u7f6e\u5220\u9664,\u4efb\u610f\u4f4d\u7f6e\u6dfb\u52a0<\/span>
\n#<\/span>include<\/span> <stdio.h><\/span><\/span>
\n#<\/span>include<\/span> <string.h><\/span><\/span>
\n#<\/span>include<\/span> "array.h"<\/span><\/span>
\nstatic<\/span> int<\/span> isNull<\/span>(<\/span>myArrayOP*<\/span> self)<\/span>{<\/span>
\n if<\/span> (<\/span>self ==<\/span>0<\/span> ||<\/span> self-><\/span>data ==<\/span>0<\/span>)<\/span>{<\/span>return<\/span> 1<\/span>;<\/span>}<\/span>
\n return<\/span> 0<\/span>;<\/span>
\n}<\/span>
\nstatic<\/span> int<\/span> isNullOrEmpty<\/span>(<\/span>myArrayOP*<\/span> self)<\/span>{<\/span>
\n if<\/span> (<\/span>isNull<\/span>(<\/span>self)<\/span> ||<\/span> self-><\/span>length ==<\/span>0<\/span>)<\/span>
\n {<\/span>
\n return<\/span> 1<\/span>;<\/span>
\n }<\/span>
\n return<\/span> 0<\/span>;<\/span><\/p>\n

}<\/span>
\nstatic<\/span> void<\/span>*<\/span> slice<\/span>(<\/span>myArrayOP*<\/span> self,<\/span>unsigned<\/span> int<\/span> i)<\/span>{<\/span>
\n if<\/span> (<\/span>i>=<\/span> self-><\/span>length ||<\/span> i<<\/span>0<\/span>)<\/span>
\n {<\/span>
\n return<\/span> 0<\/span>;<\/span>
\n }<\/span><\/p>\n

return<\/span> self-><\/span>data+<\/span>self-><\/span>size*<\/span>i;<\/span>
\n}<\/span>
\nstatic<\/span> int<\/span> del<\/span>(<\/span>myArrayOP*<\/span> self,<\/span>unsigned<\/span> int<\/span> where)<\/span>{<\/span>
\n if<\/span> (<\/span>isNullOrEmpty<\/span>(<\/span>self)<\/span>)<\/span>
\n {<\/span>
\n return<\/span> 0<\/span>;<\/span>
\n }<\/span>\/\/\u5224\u65ad\u662f\u5426\u975e\u7a7a<\/span>
\n void<\/span>*<\/span> data =<\/span> self-><\/span>data;<\/span>
\n if<\/span> (<\/span>where ><\/span> self-><\/span>length ||<\/span> where <<\/span>0<\/span>)<\/span>
\n {<\/span>
\n return<\/span> 0<\/span>;<\/span>
\n }<\/span>
\n if<\/span> (<\/span>self-><\/span>length ==<\/span> where+<\/span>1<\/span>)<\/span>\/\/\u5982\u679c\u6700\u540e\u4e00\u4e2a,\u5219\u76f4\u63a5\u79fb\u52a8length,\u907f\u514d\u8d8a\u754c<\/span>
\n {<\/span>
\n self-><\/span>length =<\/span> self-><\/span>length–<\/span>1<\/span>;<\/span>
\n return<\/span> 0<\/span>;<\/span>
\n }<\/span><\/p>\n

for<\/span> (<\/span>unsigned<\/span> int<\/span> i =<\/span> where;<\/span> i <<\/span> self-><\/span>length;<\/span> i++<\/span>)<\/span>
\n {<\/span>
\n \/\/ data->data[i] = data->data[i+1];<\/span>
\n memcpy<\/span>(<\/span>data+<\/span>self-><\/span>size*<\/span>i,<\/span>data+<\/span>self-><\/span>size*<\/span>(<\/span>i+<\/span>1<\/span>)<\/span>,<\/span>self-><\/span>size)<\/span>;<\/span>
\n }<\/span>
\n self-><\/span>length =<\/span> self-><\/span>length–<\/span>1<\/span>;<\/span>
\n return<\/span> 0<\/span>;<\/span><\/p>\n

}<\/span>
\nstatic<\/span> void<\/span>*<\/span> delNoFree<\/span> (<\/span>myArrayOP*<\/span> self,<\/span>unsigned<\/span> int<\/span> where)<\/span>{<\/span>
\n if<\/span> (<\/span>isNullOrEmpty<\/span>(<\/span>self)<\/span>)<\/span>
\n {<\/span>
\n return<\/span> 0<\/span>;<\/span>
\n }<\/span>\/\/\u5224\u65ad\u662f\u5426\u975e\u7a7a<\/span>
\n void<\/span>*<\/span> ret =<\/span> malloc<\/span>(<\/span>self-><\/span>size)<\/span>;<\/span>
\n memcpy<\/span>(<\/span>ret,<\/span>self-><\/span>slice<\/span>(<\/span>self,<\/span>where)<\/span>,<\/span>self-><\/span>size)<\/span>;<\/span>
\n del<\/span>(<\/span>self,<\/span>where)<\/span>;<\/span>
\n return<\/span> ret;<\/span>
\n}<\/span>
\nstatic<\/span> int<\/span> insert<\/span>(<\/span>myArrayOP*<\/span> self,<\/span>unsigned<\/span> int<\/span> where,<\/span>void<\/span>*<\/span> obj)<\/span>{<\/span>
\n if<\/span> (<\/span>isNull<\/span>(<\/span>self)<\/span>)<\/span>
\n {<\/span>
\n return<\/span> 0<\/span>;<\/span>
\n }<\/span>\/\/\u5224\u65ad\u662f\u5426\u975e\u7a7a<\/span>
\n void<\/span>*<\/span> data =<\/span> self-><\/span>data;<\/span>
\n if<\/span> (<\/span>self-><\/span>length ==<\/span> self-><\/span>max_length)<\/span>
\n {<\/span>
\n return<\/span> 0<\/span>;<\/span>
\n }<\/span>
\n if<\/span> (<\/span>where ><\/span> self-><\/span>length||<\/span>where<<\/span>0<\/span>)<\/span>
\n {<\/span>
\n return<\/span> 0<\/span>;<\/span>
\n }<\/span><\/p>\n

if<\/span> (<\/span>self-><\/span>length ==<\/span>0<\/span>)<\/span>
\n {<\/span>
\n \/\/ data->data[0] = obj;<\/span>
\n memcpy<\/span>(<\/span>data,<\/span>obj,<\/span>self-><\/span>size)<\/span>;<\/span>
\n self-><\/span>length++<\/span>;<\/span>
\n return<\/span> 1<\/span>;<\/span>
\n }<\/span> <\/p>\n

for<\/span> (<\/span>unsigned<\/span> int<\/span> i =<\/span>self-><\/span>length ;<\/span> i ><\/span> where;<\/span> i—<\/span>)<\/span>
\n {<\/span>
\n memcpy<\/span>(<\/span>data+<\/span>self-><\/span>size*<\/span>i,<\/span>data+<\/span>self-><\/span>size*<\/span>(<\/span>i–<\/span>1<\/span>)<\/span>,<\/span>self-><\/span>size)<\/span>;<\/span>
\n }<\/span>
\n self-><\/span>length =<\/span> self-><\/span>length+<\/span>1<\/span>;<\/span>
\n memcpy<\/span>(<\/span>data+<\/span>where*<\/span>self-><\/span>size,<\/span>obj,<\/span>self-><\/span>size)<\/span>;<\/span><\/p>\n

return<\/span> 1<\/span>;<\/span>
\n}<\/span><\/p>\n

static<\/span> int<\/span> insertHead<\/span>(<\/span>myArrayOP*<\/span> self,<\/span>void<\/span>*<\/span> num)<\/span>{<\/span>
\n return<\/span> insert<\/span>(<\/span>self,<\/span>0<\/span>,<\/span>num)<\/span>;<\/span>
\n}<\/span>
\nstatic<\/span> int<\/span> insertTail<\/span>(<\/span>myArrayOP*<\/span> self,<\/span>void<\/span>*<\/span> num)<\/span>{<\/span>
\n if<\/span> (<\/span>isNull<\/span>(<\/span>self)<\/span>)<\/span>
\n {<\/span>
\n return<\/span> 0<\/span>;<\/span>
\n }<\/span>\/\/\u5224\u65ad\u662f\u5426\u975e\u7a7a<\/span>
\n return<\/span> insert<\/span>(<\/span>self,<\/span>self-><\/span>length,<\/span>num)<\/span>;<\/span><\/p>\n

}<\/span>
\nstatic<\/span> int<\/span> delHead<\/span> (<\/span>myArrayOP*<\/span> self)<\/span>{<\/span>
\n return<\/span> del<\/span>(<\/span>self,<\/span>0<\/span>)<\/span>;<\/span>
\n}<\/span>
\nstatic<\/span> int<\/span> delTail<\/span> (<\/span>myArrayOP*<\/span> self)<\/span>{<\/span>
\n return<\/span> del<\/span>(<\/span>self,<\/span>self-><\/span>length)<\/span>;<\/span>
\n}<\/span>
\nstatic<\/span> void<\/span>*<\/span> delHeadNoFree<\/span> (<\/span>myArrayOP*<\/span> self)<\/span>{<\/span>
\n return<\/span> delNoFree<\/span>(<\/span>self,<\/span>0<\/span>)<\/span>;<\/span>
\n}<\/span>
\nstatic<\/span> void<\/span>*<\/span> delTailNoFree<\/span> (<\/span>myArrayOP*<\/span> self)<\/span>{<\/span>
\n return<\/span> delNoFree<\/span>(<\/span>self,<\/span>self-><\/span>length–<\/span>1<\/span>)<\/span>;<\/span>
\n}<\/span>
\nstatic<\/span> unsigned<\/span> int<\/span> find<\/span>(<\/span>struct<\/span> myArrayOP<\/span>*<\/span>self,<\/span>void<\/span>*<\/span> obj,<\/span>unsigned<\/span> int<\/span> times)<\/span>{<\/span>
\n void<\/span>*<\/span> p =<\/span>0<\/span>;<\/span>
\n unsigned<\/span> int<\/span> count =<\/span>0<\/span>;<\/span>
\n for<\/span> (<\/span>unsigned<\/span> int<\/span> i =<\/span> 0<\/span>;<\/span> i <<\/span> –<\/span>1<\/span>;<\/span> i++<\/span>)<\/span>
\n {<\/span>
\n p=<\/span>slice<\/span>(<\/span>self,<\/span>i)<\/span>;<\/span>
\n if<\/span> (<\/span>p==<\/span>0<\/span>)<\/span>
\n {<\/span>
\n break<\/span>;<\/span>
\n }<\/span>
\n if<\/span> (<\/span>p==<\/span>obj)<\/span>
\n {<\/span>
\n if<\/span> (<\/span>times ==<\/span> count)<\/span>
\n {<\/span>
\n return<\/span> i;<\/span>
\n }<\/span>
\n count ++<\/span>;<\/span>
\n }<\/span><\/p>\n

}<\/span>
\n return<\/span> –<\/span>1<\/span>;<\/span>
\n}<\/span>
\nstatic<\/span> unsigned<\/span> int<\/span> findby<\/span>(<\/span>struct<\/span> myArrayOP<\/span>*<\/span>self,<\/span>int<\/span>(<\/span>*<\/span>cmp)<\/span>(<\/span>void<\/span>*<\/span>,<\/span>void<\/span>*<\/span>)<\/span>,<\/span>void<\/span>*<\/span>(<\/span>*<\/span>filed)<\/span>(<\/span>void<\/span>*<\/span>)<\/span>,<\/span>void<\/span>*<\/span>target,<\/span>unsigned<\/span> int<\/span> times)<\/span>{<\/span>\/\/cmp\u5e94\u8be5\u8fd4\u56de\u662f\u5426\u662f\u8981\u627e\u7684\u503c<\/span>
\n void<\/span>*<\/span> p =<\/span>0<\/span>;<\/span>
\n unsigned<\/span> int<\/span> count =<\/span>0<\/span>;<\/span>
\n for<\/span> (<\/span>unsigned<\/span> int<\/span> i =<\/span> 0<\/span>;<\/span> i <<\/span> –<\/span>1<\/span>;<\/span> i++<\/span>)<\/span>
\n {<\/span>
\n p=<\/span>self-><\/span>slice<\/span>(<\/span>self,<\/span>i)<\/span>;<\/span>
\n if<\/span> (<\/span>p==<\/span>0<\/span>)<\/span>
\n {<\/span>
\n break<\/span>;<\/span>
\n }<\/span>
\n if<\/span> (<\/span>cmp<\/span>(<\/span>filed<\/span>(<\/span>p)<\/span>,<\/span>target)<\/span>==<\/span>0<\/span>)<\/span>
\n {<\/span>
\n if<\/span> (<\/span>times ==<\/span> count)<\/span>
\n {<\/span>
\n return<\/span> i;<\/span>
\n }<\/span>
\n count ++<\/span>;<\/span>
\n }<\/span>
\n }<\/span>
\n return<\/span> –<\/span>1<\/span>;<\/span>
\n}<\/span>
\nstatic<\/span> unsigned<\/span> int<\/span> _index<\/span>(<\/span>myArrayOP*<\/span> self,<\/span>void<\/span>*<\/span> obj)<\/span>{<\/span>
\n return<\/span> find<\/span>(<\/span>self,<\/span> obj,<\/span>0<\/span>)<\/span>;<\/span>
\n}<\/span><\/p>\n

static<\/span> unsigned<\/span> int<\/span> unic<\/span> (<\/span>struct<\/span> myArrayOP<\/span>*<\/span>self,<\/span>void<\/span>*<\/span>(<\/span>*<\/span>field)<\/span>(<\/span>void<\/span>*<\/span>)<\/span>,<\/span>unsigned<\/span> int<\/span> times)<\/span>{<\/span>
\n unsigned<\/span> int<\/span> count=<\/span>0<\/span>;<\/span>
\n unsigned<\/span> int<\/span> ret =<\/span>0<\/span>;<\/span>
\n for<\/span> (<\/span>unsigned<\/span> int<\/span> i =<\/span> 1<\/span>;<\/span> i <<\/span> self-><\/span>length;<\/span> i++<\/span>)<\/span>
\n {<\/span>
\n count =<\/span>0<\/span>;<\/span>
\n for<\/span> (<\/span>unsigned<\/span> int<\/span> j =<\/span> i+<\/span>1<\/span>;<\/span> j <<\/span> self-><\/span>length;<\/span> j++<\/span>)<\/span>
\n {<\/span>
\n if<\/span> (<\/span>memcmp<\/span>(<\/span>field<\/span>(<\/span>self-><\/span>slice<\/span>(<\/span>self,<\/span>i)<\/span>)<\/span>,<\/span>field<\/span>(<\/span>self-><\/span>slice<\/span>(<\/span>self,<\/span>j)<\/span>)<\/span>,<\/span>self-><\/span>size)<\/span>==<\/span>0<\/span>)<\/span>
\n {<\/span>
\n if<\/span> (<\/span>count >=<\/span> times)<\/span>
\n {<\/span>
\n self-><\/span>del<\/span>(<\/span>self,<\/span>j)<\/span>;<\/span>
\n j=<\/span>j–<\/span>1<\/span>;<\/span>
\n }<\/span>
\n count=<\/span>count+<\/span>1<\/span>;<\/span>
\n ret =<\/span> ret+<\/span>1<\/span>;<\/span>
\n }<\/span>
\n }<\/span>
\n }<\/span>
\n return<\/span> ret;<\/span>
\n}<\/span>
\nstatic<\/span> void<\/span> print<\/span>(<\/span>myArrayOP *<\/span> self)<\/span>{<\/span>
\n void<\/span>*<\/span> obj;<\/span>
\n unsigned<\/span> int<\/span> i=<\/span>0<\/span>;<\/span>
\n if<\/span> (<\/span>isNullOrEmpty<\/span>(<\/span>self)<\/span>)<\/span>
\n {<\/span>
\n return<\/span>;<\/span>
\n }<\/span>
\n while<\/span> (<\/span>obj=<\/span>self-><\/span>slice<\/span>(<\/span>self,<\/span>i++<\/span>)<\/span>)<\/span>
\n {<\/span>
\n self-><\/span>__str<\/span>(<\/span>obj)<\/span>;<\/span>
\n }<\/span>
\n printf<\/span>(<\/span>"\\\\n"<\/span>)<\/span>;<\/span>
\n return<\/span>;<\/span>
\n}<\/span>
\nstatic<\/span> void<\/span> destory<\/span>(<\/span>myArrayOP *<\/span>self)<\/span>{<\/span>
\n if<\/span> (<\/span>self ==<\/span>0<\/span>)<\/span>
\n {<\/span>
\n return<\/span>;<\/span>
\n }<\/span>
\n if<\/span> (<\/span>self-><\/span>data ==<\/span>0<\/span>)<\/span>
\n {<\/span>
\n return<\/span>;<\/span>
\n }<\/span>
\n free<\/span> (<\/span>self-><\/span>data)<\/span>;<\/span>
\n self-><\/span>data=<\/span>0<\/span>;<\/span>
\n free<\/span>(<\/span>self)<\/span>;<\/span>
\n}<\/span><\/p>\n

static<\/span> void<\/span> _quickSort<\/span>(<\/span>myArrayOP *<\/span>self,<\/span>long<\/span> int<\/span> start,<\/span>long<\/span> int<\/span> end,<\/span>int<\/span>(<\/span>*<\/span>cmp)<\/span>(<\/span>void<\/span>*<\/span>,<\/span> void<\/span>*<\/span>)<\/span>,<\/span>void<\/span>*<\/span>(<\/span>*<\/span>filed)<\/span>(<\/span>void<\/span>*<\/span>)<\/span>,<\/span>int<\/span> reverse)<\/span>{<\/span>
\n if<\/span> (<\/span>start <<\/span> end)<\/span> {<\/span>
\n void<\/span>*<\/span> base =<\/span> malloc<\/span>(<\/span>self-><\/span>size)<\/span>;<\/span>
\n memcpy<\/span>(<\/span>base,<\/span>slice<\/span>(<\/span>self,<\/span> start)<\/span>,<\/span>self-><\/span>size)<\/span>;<\/span>\/\/ \u4ee5\u8981\u8fdb\u884c\u6392\u5e8f\u6570\u7ec4\u7b2c0\u4e2a\u5143\u7d20\u4e3abase<\/span>
\n int<\/span> left =<\/span> start;<\/span> \/\/ \u5de6\u6307\u9488<\/span>
\n int<\/span> right =<\/span> end;<\/span> \/\/ \u53f3\u6307\u9488<\/span><\/p>\n

while<\/span> (<\/span>left <<\/span> right)<\/span> {<\/span>
\n \/\/ \u4ece\u53f3\u5411\u5de6\u627e，\u627e\u5230\u6bd4base\u5c0f\u7684\u5143\u7d20<\/span>
\n while<\/span> (<\/span>left <<\/span> right &&<\/span> (<\/span>cmp<\/span>(<\/span>filed<\/span>(<\/span>slice<\/span>(<\/span>self,<\/span> right)<\/span>)<\/span>,<\/span> filed<\/span>(<\/span>base)<\/span>)<\/span> *<\/span> reverse)<\/span> >=<\/span> 0<\/span>)<\/span> {<\/span>
\n right—<\/span>;<\/span>
\n }<\/span>
\n memcpy<\/span>(<\/span>slice<\/span>(<\/span>self,<\/span> left)<\/span>,<\/span>slice<\/span>(<\/span>self,<\/span> right)<\/span>,<\/span>self-><\/span>size)<\/span>;<\/span>
\n while<\/span> (<\/span>left <<\/span> right &&<\/span> (<\/span>cmp<\/span>(<\/span>filed<\/span>(<\/span>slice<\/span>(<\/span>self,<\/span> left)<\/span>)<\/span>,<\/span> filed<\/span>(<\/span>base)<\/span>)<\/span> *<\/span> reverse)<\/span> <=<\/span> 0<\/span>)<\/span> {<\/span>
\n left++<\/span>;<\/span>
\n }<\/span>
\n memcpy<\/span>(<\/span>slice<\/span>(<\/span>self,<\/span> right)<\/span>,<\/span>slice<\/span>(<\/span>self,<\/span> left)<\/span>,<\/span>self-><\/span>size)<\/span>;<\/span>
\n }<\/span>
\n \/\/ slice(self, left)->data = base; \/\/ \u5c06base\u653e\u5230\u6b63\u786e\u7684\u4f4d\u7f6e<\/span>
\n memcpy<\/span>(<\/span>slice<\/span>(<\/span>self,<\/span> left)<\/span>,<\/span>base,<\/span>self-><\/span>size)<\/span>;<\/span>
\n free<\/span>(<\/span>base)<\/span>;<\/span>
\n \/\/ \u9012\u5f52\u6392\u5e8f\u5de6\u53f3\u5b50\u6570\u7ec4<\/span>
\n _quickSort<\/span>(<\/span>self,<\/span> start,<\/span> left –<\/span> 1<\/span>,<\/span> cmp,<\/span>filed,<\/span> reverse)<\/span>;<\/span>
\n _quickSort<\/span>(<\/span>self,<\/span> left +<\/span> 1<\/span>,<\/span> end,<\/span> cmp,<\/span>filed,<\/span> reverse)<\/span>;<\/span>
\n }<\/span>
\n}<\/span>
\nstatic<\/span> void<\/span> quickSort<\/span>(<\/span>myArrayOP *<\/span>self,<\/span>int<\/span>(<\/span>*<\/span>cmp)<\/span>(<\/span>void<\/span>*<\/span>,<\/span> void<\/span>*<\/span>)<\/span>,<\/span>void<\/span>*<\/span>(<\/span>*<\/span>filed)<\/span>(<\/span>void<\/span>*<\/span>)<\/span>,<\/span>int<\/span> reverse)<\/span>{<\/span>
\n if<\/span> (<\/span>isNullOrEmpty<\/span>(<\/span>self)<\/span>)<\/span>
\n {<\/span>
\n return<\/span>;<\/span>
\n }<\/span>
\n return<\/span> _quickSort<\/span>(<\/span>self,<\/span>0<\/span>,<\/span>self-><\/span>length–<\/span>1<\/span>,<\/span>cmp,<\/span>filed,<\/span>reverse)<\/span>;<\/span>
\n}<\/span>
\nstatic<\/span> unsigned<\/span> short<\/span> int<\/span> mysizeof<\/span>(<\/span>char<\/span> *<\/span> obj,<\/span>unsigned<\/span> int<\/span> size)<\/span>{<\/span>
\n if<\/span> (<\/span>obj==<\/span>0<\/span>||<\/span>size==<\/span>0<\/span>)<\/span>{<\/span>return<\/span> 0<\/span>;<\/span>}<\/span>
\n for<\/span> (<\/span>;<\/span> size><\/span>1<\/span>&&<\/span>*<\/span>(<\/span>char<\/span>*<\/span>)<\/span>(<\/span>obj+<\/span>size–<\/span>1<\/span>)<\/span> –<\/span> *<\/span>(<\/span>char<\/span>*<\/span>)<\/span>(<\/span>obj+<\/span>size–<\/span>2<\/span>)<\/span>==<\/span>0<\/span>;<\/span> size—<\/span>)<\/span>;<\/span>\/\/\u5c3e\u5730\u5740\u4e3aobj+size-1<\/span>
\n return<\/span> size;<\/span>
\n}<\/span>
\nstatic<\/span> unsigned<\/span> int<\/span> pack<\/span>(<\/span>myArrayOP *<\/span>self,<\/span>char<\/span>*<\/span> buf,<\/span>unsigned<\/span> int<\/span> length)<\/span>{<\/span>
\n \/\/\u5c06\u5bf9\u8c61\u6253\u5305\u6210\u5b57\u8282\u6d41<\/span>
\n \/\/\u683c\u5f0f：unsigened short int used（2\u5b57\u8282)unsigened short int len(2\u5b57\u8282)data<\/span>
\n \/\/\u5982\u679c\u5b9a\u4e49\u4e86\u5b8f __PACK_WRITE_MAXSIZE__,\u5219\u5728used\u540e\u5199\u5165max_size <\/span>
\n unsigned<\/span> int<\/span> used=<\/span>0<\/span>;<\/span>
\n void<\/span>*<\/span> obj=<\/span>0<\/span>;<\/span>
\n unsigned<\/span> short<\/span> int<\/span> size=<\/span>0<\/span>;<\/span>
\n unsigned<\/span> int<\/span> min_buf_len =<\/span> sizeof<\/span>(<\/span>unsigned<\/span> short<\/span> int<\/span>)<\/span>*<\/span>2<\/span>;<\/span>
\n self-><\/span>packed=<\/span>0<\/span>;<\/span>
\n if<\/span> (<\/span>self-><\/span>pack_use_max_size)<\/span>
\n {<\/span>
\n min_buf_len =<\/span> sizeof<\/span>(<\/span>unsigned<\/span> short<\/span> int<\/span>)<\/span>*<\/span>3<\/span>;<\/span>
\n }<\/span>
\n if<\/span> (<\/span>length<<\/span>min_buf_len)<\/span>
\n {<\/span>
\n return<\/span> 0<\/span>;<\/span>
\n }<\/span>
\n if<\/span> (<\/span>isNullOrEmpty<\/span>(<\/span>self)<\/span>)<\/span>
\n {<\/span>
\n return<\/span> 0<\/span>;<\/span>
\n }<\/span>
\n \/\/ \u4e3a\u603b\u5927\u5c0f\u817e\u51fa\u7a7a\u95f4<\/span>
\n used+=<\/span>sizeof<\/span>(<\/span>unsigned<\/span> short<\/span> int<\/span>)<\/span>;<\/span><\/p>\n

if<\/span> (<\/span>self-><\/span>pack_use_max_size)<\/span>
\n {<\/span>
\n *<\/span>(<\/span>unsigned<\/span> short<\/span> int<\/span> *<\/span>)<\/span>(<\/span>buf+<\/span>used)<\/span> =<\/span>self-><\/span>size;<\/span>
\n used+=<\/span>sizeof<\/span>(<\/span>unsigned<\/span> short<\/span> int<\/span>)<\/span>;<\/span>
\n }<\/span>
\n \/\/\u518d\u5faa\u73af\u5199\u5165\u6bcf\u4e2a\u5143\u7d20<\/span>
\n while<\/span>(<\/span>obj=<\/span>self-><\/span>slice<\/span>(<\/span>self,<\/span>self-><\/span>__lastPacked++<\/span>)<\/span>)<\/span>{<\/span>
\n size =<\/span> mysizeof<\/span>(<\/span>obj,<\/span>self-><\/span>size)<\/span>;<\/span>
\n \/\/\u9700\u8981\u5199\u5165\u7684\u5b57\u8282\u6570\u4e3asize+sizeof（unsigned short int）<\/span>
\n \/\/\u5982\u679c\u5199\u5165\u91cf\u8d85\u8fc7\u957f\u5ea6，\u5219\u8fd4\u56de\u5b9e\u9645\u4f7f\u7528\u91cf；<\/span>
\n if<\/span> (<\/span>used+<\/span>size+<\/span>sizeof<\/span>(<\/span>unsigned<\/span> short<\/span> int<\/span>)<\/span>><\/span>length)<\/span>
\n {<\/span>
\n *<\/span>(<\/span>unsigned<\/span> short<\/span> int<\/span> *<\/span>)<\/span>(<\/span>buf)<\/span> =<\/span>used;<\/span>
\n self-><\/span>__lastPacked—<\/span>;<\/span>\/\/\u56de\u9000\u8ba1\u6570\u5668<\/span>
\n return<\/span> used;<\/span>\/\/\u672a\u6253\u5305\u5b8c,\u8fd4\u56de\u4f7f\u7528\u91cf<\/span>
\n }<\/span>
\n \/\/\u5426\u5219\u5219\u5199\u5165\u5927\u5c0f\u548c\u6570\u636e<\/span>
\n *<\/span>(<\/span>unsigned<\/span> short<\/span> int<\/span> *<\/span>)<\/span>(<\/span>buf+<\/span>used)<\/span> =<\/span>size;<\/span>
\n used+=<\/span>sizeof<\/span>(<\/span>unsigned<\/span> short<\/span> int<\/span>)<\/span>;<\/span>
\n memcpy<\/span>(<\/span>buf+<\/span>used,<\/span>obj,<\/span>size)<\/span>;<\/span>
\n used+=<\/span>size;<\/span>
\n }<\/span>
\n self-><\/span>__lastPacked =<\/span> 0<\/span>;<\/span>\/\/\u8fd9\u91cc\u8bf4\u660e\u6253\u5305\u5b8c\u4e86<\/span>
\n self-><\/span>packed=<\/span>1<\/span>;<\/span>
\n *<\/span>(<\/span>unsigned<\/span> short<\/span> int<\/span> *<\/span>)<\/span>(<\/span>buf)<\/span> =<\/span>used;<\/span>
\n return<\/span> used;<\/span>
\n}<\/span>
\nmyArrayOP*<\/span> myArrayUnpack<\/span>(<\/span>char<\/span> pack_use_max_size,<\/span>char<\/span>*<\/span> buf,<\/span>void<\/span>(<\/span>*<\/span>printData)<\/span>(<\/span>void<\/span>*<\/span>)<\/span>)<\/span>{<\/span>
\n unsigned<\/span> int<\/span> total =<\/span> *<\/span>(<\/span>unsigned<\/span> short<\/span> int<\/span> *<\/span>)<\/span>buf;<\/span>\/\/\u534f\u8bae\u5305\u7684\u603b\u5927\u5c0f<\/span>
\n if<\/span> (<\/span>total<<\/span>2<\/span>*<\/span>sizeof<\/span>(<\/span>unsigned<\/span> short<\/span> int<\/span>)<\/span>+<\/span>1<\/span>)<\/span>\/\/\u5982\u679c\u6bd4\u6700\u5c0f\u7684\u60c5\u51b5\u8fd8\u5c0f(\u4e00\u4e2a\u603b\u5927\u5c0f,\u4e00\u4e2a\u5bf9\u8c61,\u5bf9\u8c61\u53ea\u5199\u5165\u4e86\u4e00\u4e2a\u5b57\u8282)<\/span>
\n {<\/span>
\n return<\/span> 0<\/span>;<\/span>
\n }<\/span><\/p>\n

\/\/\u5148\u5faa\u73af\u904d\u5386,\u627e\u5230\u6700\u5927\u7684\u5143\u7d20\u5927\u5c0f\u548c\u8981\u7533\u8bf7\u7684\u5730\u5740\u7684\u5927\u5c0f<\/span>
\n unsigned<\/span> int<\/span> delta=<\/span>sizeof<\/span>(<\/span>unsigned<\/span> short<\/span> int<\/span>)<\/span>;<\/span>\/\/\u504f\u79fb\u91cf,\u5934\u4e24\u4e2a\u5b57\u8282\u662f\u534f\u8bae\u5305\u5927\u5c0f<\/span>
\n unsigned<\/span> int<\/span> num =<\/span>0<\/span>;<\/span>\/\/\u603b\u5143\u7d20\u6570\u91cf<\/span>
\n unsigned<\/span> int<\/span> maxSize =<\/span> *<\/span>(<\/span>unsigned<\/span> short<\/span> int<\/span> *<\/span>)<\/span>(<\/span>buf+<\/span>delta)<\/span>;<\/span>\/\/\u6700\u5927\u5143\u7d20\u7684\u5927\u5c0f,\u5047\u8bbe\u7b2c\u4e00\u4e2a\u6700\u5927<\/span>
\n unsigned<\/span> int<\/span> currentSize=<\/span>0<\/span>;<\/span>
\n if<\/span> (<\/span>pack_use_max_size)<\/span>
\n {<\/span>
\n \/\/ \u5982\u679c\u6709\u5199max_size \u5219\u4f7f\u7528<\/span>
\n maxSize =<\/span> *<\/span>(<\/span>unsigned<\/span> short<\/span> int<\/span> *<\/span>)<\/span>(<\/span>buf+<\/span>sizeof<\/span>(<\/span>unsigned<\/span> short<\/span> int<\/span>)<\/span>)<\/span>;<\/span>
\n delta+=<\/span>sizeof<\/span>(<\/span>unsigned<\/span> short<\/span> int<\/span>)<\/span>;<\/span>
\n }<\/span><\/p>\n

while<\/span> (<\/span>delta<<\/span>total)<\/span>\/\/\u4e0d\u4f1a\u51fa\u73b0\u7b49\u4e8e,\u6700\u5c11\u4f1a\u5199\u51651\u5b57\u8282\u7684obj<\/span>
\n {<\/span>
\n num=<\/span>num+<\/span>1<\/span>;<\/span>
\n currentSize =<\/span> *<\/span>(<\/span>unsigned<\/span> short<\/span> int<\/span> *<\/span>)<\/span>(<\/span>buf+<\/span>delta)<\/span>;<\/span>
\n if<\/span> (<\/span>maxSize<<\/span>currentSize)<\/span>
\n {<\/span>
\n maxSize =<\/span> currentSize;<\/span>
\n }<\/span>
\n delta+=<\/span>currentSize+<\/span>sizeof<\/span>(<\/span>unsigned<\/span> short<\/span> int<\/span>)<\/span>;<\/span>
\n }<\/span><\/p>\n

delta =<\/span> sizeof<\/span>(<\/span>unsigned<\/span> short<\/span> int<\/span>)<\/span>;<\/span>
\n \/\/\u518d\u7533\u8bf7\u5185\u5b58<\/span>
\n myArrayOP*<\/span> arr =<\/span> myArrayInit<\/span>(<\/span>maxSize*<\/span>num,<\/span>maxSize,<\/span>printData)<\/span>;<\/span>if<\/span> (<\/span>arr ==<\/span> 0<\/span>)<\/span>{<\/span>return<\/span> 0<\/span>;<\/span>}<\/span>
\n \/\/\u4e3a\u4e86\u65b9\u4fbf\u8fd8\u539f\u6570\u636e,\u7533\u8bf7maxSize\u5927\u5c0f\u7684\u5185\u5b58;<\/span>
\n void<\/span>*<\/span> obj=<\/span>malloc<\/span>(<\/span>maxSize)<\/span>;<\/span>if<\/span> (<\/span>obj ==<\/span> 0<\/span>)<\/span>{<\/span>return<\/span> 0<\/span>;<\/span>}<\/span><\/p>\n

while<\/span> (<\/span>delta<<\/span>total)<\/span>\/\/\u4e0d\u4f1a\u51fa\u73b0\u7b49\u4e8e,\u6700\u5c11\u4f1a\u5199\u51651\u5b57\u8282\u7684obj<\/span>
\n {<\/span>
\n currentSize =<\/span> *<\/span>(<\/span>unsigned<\/span> short<\/span> int<\/span> *<\/span>)<\/span>(<\/span>buf+<\/span>delta)<\/span>;<\/span>
\n delta+=<\/span>sizeof<\/span>(<\/span>unsigned<\/span> short<\/span> int<\/span>)<\/span>;<\/span>
\n memset<\/span>(<\/span>obj,<\/span>*<\/span>(<\/span>char<\/span>*<\/span>)<\/span>(<\/span>buf+<\/span>delta+<\/span>currentSize–<\/span>1<\/span>)<\/span>,<\/span>maxSize)<\/span>;<\/span>\/\/\u4ee5\u6700\u540e\u4e00\u4e2a\u5b57\u8282\u521d\u59cb\u5316<\/span>
\n memcpy<\/span>(<\/span>obj,<\/span>buf+<\/span>delta,<\/span>currentSize)<\/span>;<\/span>
\n delta+=<\/span>currentSize;<\/span>
\n arr-><\/span>append<\/span>(<\/span>arr,<\/span>obj)<\/span>;<\/span>
\n }<\/span>
\n free<\/span>(<\/span>obj)<\/span>;<\/span>
\n arr-><\/span>pack_use_max_size=<\/span>pack_use_max_size;<\/span>\/\/\u7ee7\u627f\u539f\u6709\u7684\u683c\u5f0f<\/span>
\n return<\/span> arr;<\/span>
\n}<\/span>
\nstatic<\/span> myArrayOP*<\/span> unpack<\/span>(<\/span>myArrayOP*<\/span> self,<\/span>char<\/span>*<\/span> buf,<\/span>void<\/span>(<\/span>*<\/span>printData)<\/span>(<\/span>void<\/span>*<\/span>)<\/span>)<\/span>{<\/span>
\n \/\/\u517c\u5bb9\u5c42<\/span>
\n return<\/span> myArrayUnpack<\/span>(<\/span>self-><\/span>pack_use_max_size,<\/span>buf,<\/span>printData)<\/span>;<\/span>
\n}<\/span>
\nstatic<\/span> int<\/span> delByAddr<\/span>(<\/span>myArrayOP *<\/span>self,<\/span>void<\/span>*<\/span> obj)<\/span>{<\/span>
\n if<\/span> (<\/span>self==<\/span>0<\/span>)<\/span>
\n {<\/span>
\n return<\/span> –<\/span>1<\/span>;<\/span>
\n }<\/span>
\n if<\/span> (<\/span>isNullOrEmpty<\/span>(<\/span>self)<\/span>)<\/span>
\n {<\/span>
\n return<\/span> –<\/span>1<\/span>;<\/span>
\n }<\/span>
\n if<\/span> (<\/span>obj<<\/span>self-><\/span>data||<\/span>obj><\/span>(<\/span>self-><\/span>data+<\/span>self-><\/span>length*<\/span>self-><\/span>size)<\/span>)<\/span>
\n {<\/span>
\n return<\/span> –<\/span>1<\/span>;<\/span>
\n }<\/span>
\n unsigned<\/span> int<\/span> where =<\/span> (<\/span>unsigned<\/span> int<\/span>)<\/span>(<\/span>(<\/span>char<\/span>*<\/span>)<\/span>obj –<\/span> (<\/span>char<\/span>*<\/span>)<\/span>self-><\/span>data)<\/span>\/<\/span>self-><\/span>size;<\/span>
\n self-><\/span>del<\/span>(<\/span>self,<\/span>where)<\/span>;<\/span>
\n return<\/span> where;<\/span>
\n}<\/span>
\nstatic<\/span> int<\/span> add<\/span>(<\/span>myArrayOP *<\/span>self,<\/span>myArrayOP *<\/span>other)<\/span>{<\/span>
\n void<\/span>*<\/span> obj =<\/span>0<\/span>;<\/span>
\n unsigned<\/span> int<\/span> i =<\/span>0<\/span>;<\/span>
\n while<\/span> (<\/span>obj=<\/span>other-><\/span>slice<\/span>(<\/span>other,<\/span>i++<\/span>)<\/span>)<\/span>
\n {<\/span>
\n self-><\/span>append<\/span>(<\/span>self,<\/span>obj)<\/span>;<\/span>
\n }<\/span>
\n}<\/span>
\nstatic<\/span> int<\/span> sub<\/span>(<\/span>myArrayOP *<\/span>self,<\/span>myArrayOP *<\/span>other)<\/span>{<\/span>
\n int<\/span> ret =<\/span>0<\/span>;<\/span>
\n if<\/span> (<\/span>self ==<\/span>0<\/span>||<\/span>other ==<\/span>0<\/span>)<\/span>
\n {<\/span>
\n return<\/span> ret;<\/span>
\n }<\/span>
\n if<\/span> (<\/span>self-><\/span>isNullOrEmpty<\/span>(<\/span>self)<\/span>||<\/span>other-><\/span>isNullOrEmpty<\/span>(<\/span>other)<\/span>)<\/span>
\n {<\/span>
\n return<\/span> ret;<\/span>
\n }<\/span>
\n if<\/span> (<\/span>self-><\/span>size!=<\/span>other-><\/span>size)<\/span> \/\/\u4e24\u4e2a\u6570\u7ec4\u4e2d\u6570\u636e\u5927\u5c0f\u4e0d\u4e00\u6837,\u4e0d\u6bd4\u8f83<\/span>
\n {<\/span>
\n ret =<\/span> –<\/span>1<\/span>;<\/span>
\n return<\/span> ret;<\/span>
\n }<\/span>
\n unsigned<\/span> int<\/span> size =<\/span> self-><\/span>size;<\/span><\/p>\n

void<\/span>*<\/span> obj_self =<\/span>0<\/span>;<\/span>
\n void<\/span>*<\/span> obj_other=<\/span>0<\/span>;<\/span>
\n unsigned<\/span> int<\/span> i =<\/span>0<\/span>;<\/span>
\n unsigned<\/span> int<\/span> j=<\/span>0<\/span>;<\/span><\/p>\n

while<\/span> (<\/span>obj_other=<\/span>other-><\/span>slice<\/span>(<\/span>other,<\/span>i++<\/span>)<\/span>)<\/span>
\n {<\/span>
\n while<\/span> (<\/span>obj_self=<\/span>self-><\/span>slice<\/span>(<\/span>self,<\/span>j++<\/span>)<\/span>)<\/span>
\n {<\/span>
\n if<\/span> (<\/span>memcmp<\/span>(<\/span>obj_self,<\/span>obj_other,<\/span>size)<\/span>==<\/span>0<\/span>)<\/span>
\n {<\/span>
\n self-><\/span>delByAddr<\/span>(<\/span>self,<\/span>obj_self)<\/span>;<\/span>
\n }<\/span>
\n }<\/span>
\n }<\/span>
\n}<\/span><\/p>\n

static<\/span> myArrayOP*<\/span> copy<\/span>(<\/span>myArrayOP*<\/span> self)<\/span>{<\/span>
\n myArrayOP*<\/span> ret =<\/span> myArrayInit<\/span>(<\/span>self-><\/span>max_length,<\/span>self-><\/span>size,<\/span>self-><\/span>__str)<\/span>;<\/span>
\n memcpy<\/span>(<\/span>ret-><\/span>data,<\/span>self-><\/span>data,<\/span>self-><\/span>size*<\/span>self-><\/span>length)<\/span>;<\/span>
\n return<\/span> ret;<\/span>
\n}<\/span>
\nstatic<\/span> myArrayOP*<\/span> setter<\/span>(<\/span>myArrayOP*<\/span> self,<\/span>myArrayOP*<\/span>other)<\/span>{<\/span>
\n memcpy<\/span>(<\/span>self-><\/span>data,<\/span>other-><\/span>data,<\/span>self-><\/span>size*<\/span>self-><\/span>length)<\/span>;<\/span>
\n return<\/span> self;<\/span>
\n}<\/span>
\nmyArrayOP*<\/span> myArrayInit<\/span>(<\/span>unsigned<\/span> int<\/span> max_length,<\/span>unsigned<\/span> int<\/span> size,<\/span>void<\/span>(<\/span>*<\/span>printData)<\/span>(<\/span>void<\/span>*<\/span>)<\/span>)<\/span>{<\/span>
\n myArrayOP *<\/span> self =<\/span> 0<\/span>;<\/span>
\n self =<\/span> (<\/span>myArrayOP*<\/span>)<\/span> malloc<\/span>(<\/span>sizeof<\/span>(<\/span>myArrayOP)<\/span>)<\/span>;<\/span>
\n bzero<\/span>(<\/span>self,<\/span>sizeof<\/span>(<\/span>myArrayOP)<\/span>)<\/span>;<\/span><\/p>\n

self-><\/span>data =<\/span> calloc<\/span>(<\/span>max_length,<\/span>size)<\/span>;<\/span>
\n \/\/ malloc(sizeof(myList));<\/span>
\n bzero<\/span>(<\/span>self-><\/span>data,<\/span>sizeof<\/span>(<\/span>max_length*<\/span>size)<\/span>)<\/span>;<\/span>
\n self-><\/span>max_length=<\/span>max_length;<\/span>
\n self-><\/span>size=<\/span>size;<\/span>
\n self-><\/span>__str=<\/span>printData;<\/span>
\n self-><\/span>del =<\/span> del;<\/span>
\n self-><\/span>delHead=<\/span>delHead;<\/span>
\n self-><\/span>delTail=<\/span>delTail;<\/span>
\n self-><\/span>delNoFree=<\/span>delNoFree;<\/span>
\n self-><\/span>find=<\/span>find;<\/span>
\n self-><\/span>index=<\/span>_index;<\/span>
\n self-><\/span>insert=<\/span>insert;<\/span>
\n self-><\/span>inserTail=<\/span>insertTail;<\/span>
\n self-><\/span>insertHead=<\/span>insertHead;<\/span>
\n self-><\/span>isNullOrEmpty=<\/span>isNullOrEmpty;<\/span>
\n self-><\/span>slice=<\/span>slice;<\/span>
\n self-><\/span>unic=<\/span>unic;<\/span>
\n self-><\/span>print=<\/span>print;<\/span>
\n self-><\/span>destory=<\/span>destory;<\/span>
\n self-><\/span>delHeadNoFree=<\/span>delHeadNoFree;<\/span>
\n self-><\/span>delTailNoFree=<\/span>delTailNoFree;<\/span>
\n self-><\/span>delNoFree=<\/span>delNoFree;<\/span>
\n self-><\/span>quickSort=<\/span>quickSort;<\/span>
\n self-><\/span>_quickSort=<\/span>_quickSort;<\/span>
\n self-><\/span>append=<\/span>insertTail;<\/span>
\n self-><\/span>push=<\/span>insertTail;<\/span>
\n self-><\/span>queue=<\/span>insertTail;<\/span>
\n self-><\/span>dequeue=<\/span>delHeadNoFree;<\/span>
\n self-><\/span>pop=<\/span>delTailNoFree;<\/span>
\n self-><\/span>findby=<\/span>findby;<\/span>
\n self-><\/span>pack=<\/span>pack;<\/span>
\n self-><\/span>unpack=<\/span>unpack;<\/span>
\n self-><\/span>copy=<\/span>copy;<\/span>
\n self-><\/span>setter =<\/span> setter;<\/span>
\n return<\/span> self;<\/span>
\n}<\/span><\/p>\n

array.h<\/p>\n

#<\/span>ifndef<\/span> __MYARRAYLIST_STRUCT__<\/span><\/span>
\n#<\/span>define<\/span> __MYARRAYLIST_STRUCT__<\/span><\/span>
\n#<\/span>include<\/span> <stdlib.h><\/span><\/span>
\n\/\/ \u6570\u7ec4,\u5806\u4e0a\u7684\u5bf9\u8c61\u6570\u7ec4<\/span>
\n\/\/ \u7528\u6cd5: \u9700\u8981\u5916\u90e8\u521b\u5efa\u7ed3\u6784\u4f53\u6216\u5bf9\u8c61,\u540c\u65f6\u51c6\u5907\u597d\u8be5\u7ed3\u6784\u4f53\u6216\u5bf9\u8c61\u7684\u6253\u5370(print)\u65b9\u6cd5<\/span>
\n\/\/ \u8bf7\u6ce8\u610f:\u957f\u5ea6\u4ece0\u5f00\u59cb,\u5230length\u7ed3\u675f<\/span>
\n\/\/ \u63a8\u8350\u4ee5\u4ee5\u4e0b\u65b9\u5f0f\u8fed\u4ee3\u94fe\u8868<\/span>
\n\/\/ while(obj=.slice(,i++))<\/span>
\n\/\/ \u4ee5\u4e0b\u5212\u7ebf(_)\u5f00\u5934\u7684\u65b9\u6cd5\u4e3a\u67d0\u4e00\u65b9\u6cd5\u7684\u8865\u5145,\u6216\u662f\u4f4e\u7ea7\u5b9e\u73b0,\u7406\u60f3\u60c5\u51b5\u4e0b\u4e0d\u5e94\u5f53\u88ab\u4f7f\u7528<\/span>
\n\/\/ \u4ee5\u4e0b\u5212\u7ebf(__)\u5f00\u5934\u7684\u5b57\u6bb5\u4e3a\u5185\u90e8\u5b9e\u73b0\u4f9d\u8d56\u7684\u5b57\u6bb5,\u4e0d\u5e94\u5f53\u88ab\u5916\u754c\u6539\u53d8<\/span>
\n\/\/ \u5728\u6570\u7ec4\u7684\u5b9e\u73b0\u4e2d,\u90e8\u5206\u65b9\u6cd5\u4f9d\u8d56\u4e8e\u957f\u5ea6(.length),\u5176\u957f\u5ea6\u4e0d\u5e94\u5f53\u88ab\u6539\u53d8<\/span>
\n\/\/ \u4ee5\u4e0b\u64cd\u4f5c\u662f\u5408\u6cd5\u7684<\/span>
\n\/\/ _slice(0),_slice(length),_slice(-1),_slice(length+1)\u8fd4\u56de\u503c\u5206\u522b\u4e3a\u5934\u6570\u636e,\u5c3e\u6570\u636e,0,0<\/span>
\n\/\/ slice(1),slice(length),\u8fd4\u56de\u503c\u5206\u522b\u4e3a\u5934\u5c3e\u8282\u70b9\u5185\u5b58\u7684\u5bf9\u8c61.<\/span>
\n\/\/ \u540c\u4e00\u4e2a\u94fe\u8868\u64cd\u4f5c\u7c7b\u64cd\u4f5c\u4e0d\u540c\u7684\u94fe\u8868 \u5373op1->fun(op2,agrs) \u8be5\u7ed3\u679c\u5e94\u8be5\u4e0e op2->fun(op2,agrs) \u4e00\u81f4,\u4f46\u65e0\u6cd5\u4fdd\u8bc1\u8de8\u94fe\u8868\u64cd\u4f5c\u7c7b\u7ed3\u679c\u4e00\u81f4<\/span><\/p>\n

\/* \u5c01\u88c5\u6d4b\u8bd5\u4e8e2025\/4\/30,\u4fee\u590d\u90e8\u5206.length\u64cd\u4f5c
\n*
\n* 2025\/4\/16 \u6dfb\u52a0\u7c7b
\n* 2025\/4\/16 \u6dfb\u52a0\u901a\u7528\u7684\u6d4b\u8bd5\u65b9\u6cd5
\n* 2025\/4\/25 \u6dfb\u52a0_destory\u65b9\u6cd5,\u672a\u6d4b\u8bd5,\u7406\u5e94\u662f\u597d\u7684
\n* 2025\/4\/27 \u4fee\u590dfindby\u4e0equickSort,_quickSort,findby\u7684cmp\u51fd\u6570,\u4f7f\u5176\u7edf\u4e00,\u5e76\u65b0\u589e\u5b57\u6bb5field\u51fd\u6570,\u5e94\u5f53\u8fd4\u56de\u4e00\u5bf9\u8c61\u5185\u90e8\u7684\u5730\u5740
\n* 2025\/4\/27 \u9488\u5bf9\u6709\u5934\u5355\u9879\u94fe\u8868\u6d4b\u8bd5,\u4fee\u6539\u6709\u5934\u5355\u9879\u94fe\u8868,\u5b9a\u4e491-.length\u4e3a\u5408\u6cd5\u64cd\u4f5c
\n* 2025\/5\/9 \u4fee\u8865\u6570\u7ec4,\u4f7f\u5176\u5bf9\u4efb\u610f\u7684obj\u6709\u6548,\u91cd\u547d\u540d\u65b0\u589eNoFree\u51fd\u6570
\n* 2025\/5\/10 \u65b0\u589epack\u548cunpack\u65b9\u6cd5,\u6253\u5305\/\u89e3\u5305\u6210\u6570\u636e\u6d41
\n*\/<\/span>
\ntypedef<\/span> struct<\/span> myArrayOP<\/span>{<\/span>
\n void<\/span>*<\/span> data;<\/span> \/\/\u5806\u4e0a\u7684\u6570\u7ec4<\/span>
\n size_t<\/span> length;<\/span> \/\/\u76ee\u524d\u7684\u957f\u5ea6,0\u4e3a\u7a7a<\/span>
\n size_t<\/span> max_length;<\/span>\/\/\u6570\u7ec4\u7684\u6700\u5927\u957f\u5ea6<\/span>
\n unsigned<\/span> int<\/span> __lastPacked;<\/span>
\n char<\/span> pack_use_max_size;<\/span>\/\/\u662f\u5426\u4f7f\u7528\u6700\u5927\u7684\u5143\u7d20\u5927\u5c0f<\/span>
\n char<\/span> packed;<\/span>
\n void<\/span> (<\/span>*<\/span>__str)<\/span>(<\/span>void<\/span>*<\/span>)<\/span>;<\/span>\/\/\u6253\u5370\u65b9\u6cd5<\/span>
\n unsigned<\/span> short<\/span> int<\/span> size;<\/span>\/\/\u5185\u90e8\u6bcf\u4e2a\u5143\u7d20\u7684\u5927\u5c0f<\/span>
\n int<\/span> (<\/span>*<\/span>isNullOrEmpty)<\/span>(<\/span>struct<\/span> myArrayOP<\/span>*<\/span>)<\/span>;<\/span>\/\/\u5224\u65ad\u5217\u8868\u662f\u5426\u4e3a\u7a7a<\/span>
\n int<\/span> (<\/span>*<\/span>insertHead)<\/span>(<\/span>struct<\/span> myArrayOP<\/span>*<\/span>,<\/span>void<\/span>*<\/span> obj)<\/span>;<\/span>\/\/\u5728\u6570\u7ec4\u7684\u5934\u63d2\u5165<\/span>
\n int<\/span> (<\/span>*<\/span>inserTail)<\/span>(<\/span>struct<\/span> myArrayOP<\/span>*<\/span>,<\/span>void<\/span>*<\/span> obj)<\/span>;<\/span>\/\/\u5728\u6570\u7ec4\u7684\u672b\u5c3e\u63d2\u5165<\/span>
\n int<\/span> (<\/span>*<\/span>delHead)<\/span>(<\/span>struct<\/span> myArrayOP<\/span>*<\/span>)<\/span>;<\/span>\/\/\u5220\u9664\u6570\u7ec4\u7684\u5934<\/span>
\n int<\/span> (<\/span>*<\/span>delTail)<\/span>(<\/span>struct<\/span> myArrayOP<\/span>*<\/span>)<\/span>;<\/span>\/\/\u5220\u9664\u6570\u7ec4\u7684\u5c3e<\/span>
\n void<\/span>*<\/span> (<\/span>*<\/span>delHeadNoFree)<\/span>(<\/span>struct<\/span> myArrayOP<\/span>*<\/span>)<\/span>;<\/span>\/\/\u5220\u9664\u6570\u7ec4\u7684\u5934(\u4e0d\u4f1a\u81ea\u52a8\u8c03\u7528free),\u4f1acopy\u4e00\u4efd\u8fd4\u56de<\/span>
\n void<\/span>*<\/span> (<\/span>*<\/span>delTailNoFree)<\/span>(<\/span>struct<\/span> myArrayOP<\/span>*<\/span>)<\/span>;<\/span>\/\/\u5220\u9664\u6570\u7ec4\u7684\u5c3e(\u4e0d\u4f1a\u81ea\u52a8\u8c03\u7528free),\u4f1acopy\u4e00\u4efd\u8fd4\u56de<\/span>
\n int<\/span> (<\/span>*<\/span>del)<\/span>(<\/span>struct<\/span> myArrayOP<\/span>*<\/span>,<\/span>unsigned<\/span> int<\/span> where)<\/span>;<\/span>\/\/\u5728\u6570\u7ec4\u7684where\u5904\u5220\u9664\u67d0\u4e2a\u5bf9\u8c61(\u4f1a\u81ea\u52a8\u8c03\u7528free)<\/span>
\n void<\/span>*<\/span> (<\/span>*<\/span>delNoFree)<\/span>(<\/span>struct<\/span> myArrayOP<\/span>*<\/span>,<\/span>unsigned<\/span> int<\/span> where)<\/span>;<\/span>\/\/\u5728\u6570\u7ec4\u7684where\u5904\u5220\u9664\u67d0\u4e2a\u5bf9\u8c61(\u4e0d\u4f1a\u81ea\u52a8\u8c03\u7528free),\u4f1acopy\u4e00\u4efd\u8fd4\u56de<\/span>
\n int<\/span> (<\/span>*<\/span>insert)<\/span>(<\/span>struct<\/span> myArrayOP<\/span>*<\/span>,<\/span>unsigned<\/span> int<\/span> where,<\/span>void<\/span>*<\/span> obj)<\/span>;<\/span>\/\/\u5728\u6570\u7ec4\u7684where\u5904\u63d2\u5165\u5bf9\u8c61<\/span>
\n unsigned<\/span> int<\/span> (<\/span>*<\/span>index)<\/span>(<\/span>struct<\/span> myArrayOP<\/span>*<\/span>,<\/span>void<\/span>*<\/span> obj)<\/span>;<\/span>\/\/\u53d6\u8be5\u5bf9\u8c61\u7684\u6570\u7ec4\u4e0b\u6807<\/span>
\n unsigned<\/span> int<\/span> (<\/span>*<\/span>find)<\/span>(<\/span>struct<\/span> myArrayOP<\/span>*<\/span>,<\/span>void<\/span>*<\/span> obj,<\/span>unsigned<\/span> int<\/span> times)<\/span>;<\/span>\/\/\u67e5\u627e\u8be5\u5bf9\u8c61times+1\u6b21,\u8fd4\u56detimes+1\u6b21\u6240\u5bf9\u5e94\u7684\u4e0b\u6807,times\u4e3a0\u8868\u793a\u53d6\u7b2c\u4e00\u4e2a<\/span>
\n unsigned<\/span> int<\/span> (<\/span>*<\/span>findby)<\/span>(<\/span>struct<\/span> myArrayOP<\/span>*<\/span>self,<\/span>int<\/span>(<\/span>*<\/span>cmp)<\/span>(<\/span>void<\/span>*<\/span>,<\/span>void<\/span>*<\/span>)<\/span>,<\/span>void<\/span>*<\/span>(<\/span>*<\/span>filed)<\/span>(<\/span>void<\/span>*<\/span>)<\/span>,<\/span>void<\/span>*<\/span>target,<\/span>unsigned<\/span> int<\/span> times)<\/span>;<\/span>\/\/\u4f7f\u7528cmp\u67e5\u627e\u8be5\u5bf9\u8c61\u7684filed\u5b57\u6bb5\u5bf9\u5e94\u7684target，times+1\u6b21,\u8fd4\u56detimes+1\u6b21\u6240\u5bf9\u5e94\u7684\u4e0b\u6807,times\u4e3a0\u8868\u793a\u53d6\u7b2c\u4e00\u4e2a<\/span>
\n unsigned<\/span> int<\/span> (<\/span>*<\/span>unic)<\/span> (<\/span>struct<\/span> myArrayOP<\/span>*<\/span>self,<\/span>void<\/span>*<\/span>(<\/span>*<\/span>field)<\/span>(<\/span>void<\/span>*<\/span>)<\/span>,<\/span>unsigned<\/span> int<\/span> times)<\/span>;<\/span>\/\/\u5728\u6570\u7ec4\u4e0a\u4fdd\u8bc1\u6570\u7ec4\u4e0a\u67d0\u4e2a\u5bf9\u8c61\u6700\u591a\u4e0d\u51fa\u73b0time+1\u6b21,filed\u51fd\u6570\u5e94\u5f53\u8fd4\u56de\u7279\u5f81\u5b57\u6bb5\u7684\u5730\u5740,size\u5e94\u5f53\u8bbe\u7f6e\u4e3a\u7279\u5f81\u7684\u5927\u5c0f<\/span>
\n void<\/span>*<\/span> (<\/span>*<\/span>slice)<\/span>(<\/span>struct<\/span> myArrayOP<\/span>*<\/span> self,<\/span>unsigned<\/span> int<\/span> i)<\/span>;<\/span>\/\/\u5207\u7247\u51fd\u6570,\u6570\u7ec4\u4e0a\u7684\u7b2ci\u4e2a\u5bf9\u8c61<\/span>
\n void<\/span> (<\/span>*<\/span>destory)<\/span>(<\/span>struct<\/span> myArrayOP<\/span> *<\/span>self)<\/span>;<\/span>\/\/\u9500\u6bc1\u6570\u7ec4,\u4f1a\u91ca\u653e\u6240\u6709\u7684\u8be5\u6570\u7ec4\u4e0a\u7684\u5bf9\u8c61<\/span>
\n \/\/ void (*destoryNoFree)(struct myArrayOP *self);<\/span>
\n void<\/span> (<\/span>*<\/span>print)<\/span>(<\/span>struct<\/span> myArrayOP<\/span> *<\/span> self)<\/span>;<\/span>\/\/\u4f7f\u7528.__str\u65b9\u6cd5\u6253\u5370\u6570\u7ec4\u4e0a\u7684\u6240\u6709\u5bf9\u8c61<\/span>
\n void<\/span> (<\/span>*<\/span>_quickSort)<\/span>(<\/span>struct<\/span> myArrayOP<\/span> *<\/span>self,<\/span>long<\/span> int<\/span> start,<\/span>long<\/span> int<\/span> end,<\/span>int<\/span>(<\/span>*<\/span>cmp)<\/span>(<\/span>void<\/span>*<\/span>,<\/span> void<\/span>*<\/span>)<\/span>,<\/span>void<\/span>*<\/span>(<\/span>*<\/span>filed)<\/span>(<\/span>void<\/span>*<\/span>)<\/span>,<\/span>int<\/span> reverse)<\/span>;<\/span>\/\/\u4ecestart\u5230end\u7684\u5feb\u901f\u6392\u5e8f<\/span>
\n void<\/span> (<\/span>*<\/span>quickSort)<\/span>(<\/span>struct<\/span> myArrayOP<\/span> *<\/span>self,<\/span>int<\/span>(<\/span>*<\/span>cmp)<\/span>(<\/span>void<\/span>*<\/span>,<\/span> void<\/span>*<\/span>)<\/span>,<\/span>void<\/span>*<\/span>(<\/span>*<\/span>filed)<\/span>(<\/span>void<\/span>*<\/span>)<\/span>,<\/span>int<\/span> reverse)<\/span>;<\/span>\/\/\u6574\u4e2a\u94fe\u8868\u7684\u5feb\u901f\u6392\u5e8f,cmp\u65b9\u6cd5\u8fd4\u56de\u7ed9\u51fa\u7684\u4e24\u4e2a\u5bf9\u8c61\u54ea\u4e2a\u66f4\u5927,reverse\u4e3a\u6b63\u5219\u6b63\u5e8f,\u4e3a\u8d1f\u5219\u9006\u5e8f,0\u4e0d\u505a\u6392\u5e8f<\/span>
\n int<\/span> (<\/span>*<\/span>append)<\/span>(<\/span>struct<\/span> myArrayOP<\/span>*<\/span>,<\/span>void<\/span>*<\/span> data)<\/span>;<\/span>\/\/\u5c3e\u63d2<\/span>
\n void<\/span>*<\/span> (<\/span>*<\/span>dequeue)<\/span>(<\/span>struct<\/span> myArrayOP<\/span>*<\/span> self)<\/span>;<\/span>\/\/\u5728\u6570\u7ec4\u4e0a\u5c06\u7b2c0\u4e2a\u5143\u7d20\u5220\u9664,\u5c06\u5143\u7d20\u62f7\u8d1d\u4e00\u4efd\u5230\u65b0\u7684\u5806\u7a7a\u95f4\u5e76\u8fd4\u56de\u62f7\u8d1d\u540e\u7684\u5730\u5740,\u9700\u8981\u624b\u52a8free<\/span>
\n void<\/span>*<\/span> (<\/span>*<\/span>pop)<\/span>(<\/span>struct<\/span> myArrayOP<\/span>*<\/span> self)<\/span>;<\/span>\/\/\u5728\u6570\u7ec4\u4e0a\u5c06\u6700\u540e\u4e00\u4e2a\u5143\u7d20\u5220\u9664,\u5c06\u5143\u7d20\u62f7\u8d1d\u4e00\u4efd\u5230\u65b0\u7684\u5806\u7a7a\u95f4\u5e76\u8fd4\u56de\u62f7\u8d1d\u540e\u7684\u5730\u5740,\u9700\u8981\u624b\u52a8free<\/span>
\n int<\/span> (<\/span>*<\/span>push)<\/span>(<\/span>struct<\/span> myArrayOP<\/span>*<\/span>,<\/span>void<\/span>*<\/span> data)<\/span>;<\/span>\/\/\u62f7\u8d1d\u8be5\u5143\u7d20\u5230\u6570\u7ec4\u7684\u6700\u540e\u4e00\u4f4d<\/span>
\n int<\/span> (<\/span>*<\/span>queue)<\/span>(<\/span>struct<\/span> myArrayOP<\/span>*<\/span>,<\/span>void<\/span>*<\/span> data)<\/span>;<\/span>\/\/\u62f7\u8d1d\u8be5\u5143\u7d20\u5230\u6570\u7ec4\u7684\u6700\u540e\u4e00\u4f4d<\/span>
\n unsigned<\/span> int<\/span> (<\/span>*<\/span>pack)<\/span>(<\/span>struct<\/span> myArrayOP<\/span> *<\/span>self,<\/span>char<\/span>*<\/span> buf,<\/span>unsigned<\/span> int<\/span> length)<\/span>;<\/span>\/\/\u5c06\u5176\u5185\u90e8\u7684\u6570\u636e\u6253\u5305\u6210\u5b57\u8282\u6d41<\/span>
\n struct<\/span> myArrayOP<\/span>*<\/span> (<\/span>*<\/span>unpack)<\/span>(<\/span>struct<\/span> myArrayOP<\/span> *<\/span>self,<\/span>char<\/span>*<\/span> buf,<\/span>void<\/span>(<\/span>*<\/span>printData)<\/span>(<\/span>void<\/span>*<\/span>)<\/span>)<\/span>;<\/span>\/\/\u5c06\u5b57\u8282\u6d41\u89e3\u5305\u6210\u5185\u90e8\u6570\u636e,\u8fd4\u56de\u4e00\u4e2a\u65b0\u7684\u5bf9\u8c61<\/span>
\n int<\/span> (<\/span>*<\/span>delByAddr)<\/span>(<\/span>struct<\/span> myArrayOP<\/span> *<\/span>self,<\/span>void<\/span>*<\/span> obj)<\/span>;<\/span>\/\/\u6309\u5730\u5740\u5220\u9664\u67d0\u4e00\u5143\u7d20<\/span>
\n struct<\/span> myArrayOP<\/span> *<\/span>(<\/span>*<\/span>copy)<\/span>(<\/span>struct<\/span> myArrayOP<\/span> *<\/span>self)<\/span>;<\/span>\/\/\u62f7\u8d1d\u526f\u672c<\/span>
\n struct<\/span> myArrayOP<\/span> *<\/span>(<\/span>*<\/span>setter)<\/span>(<\/span>struct<\/span> myArrayOP<\/span> *<\/span>self,<\/span>struct<\/span> myArrayOP<\/span> *<\/span>other)<\/span>;<\/span>\/\/\u5c06other\u7684\u6570\u636e\u57df\u62f7\u8d1d\u81f3self\u7684\u6570\u636e\u57df<\/span>
\n}<\/span> myArrayOP;<\/span>
\n\/\/\u521d\u59cb\u5316\u51fd\u6570<\/span>
\nmyArrayOP*<\/span> myArrayInit<\/span>(<\/span>unsigned<\/span> int<\/span> max_length,<\/span>unsigned<\/span> int<\/span> size,<\/span>void<\/span>(<\/span>*<\/span>print)<\/span>(<\/span>void<\/span>*<\/span>)<\/span>)<\/span>;<\/span>
\n\/*
\n\u5c06\u5b57\u8282\u6d41\u89e3\u5305\u6210\u5bf9\u8c61,\u4f1a\u5199\u5165\u5c3e\u90e8\u7684\u91cd\u590d\u5b57\u8282
\n\u5b57\u8282\u6d41\u683c\u5f0f：unsigened short int used（2\u5b57\u8282)unsigened short int datalen(2\u5b57\u8282) data
\n\u5982\u679cpack_use_max_size != 0,\u4f7f\u7528used\u4e4b\u540e\u76842\u5b57\u8282\u4f5c\u4e3a\u6700\u5927\u957f\u5ea6\u8fdb\u884c\u521b\u5efa\u5185\u5b58
\nbuf:\u7f13\u51b2\u533a,\u5b57\u8282\u6d41\u8bfb\u53d6\u7684\u5730\u5740
\nprintData:\u8fd4\u56de\u64cd\u4f5c\u7c7b\u521d\u59cb\u5316\u65f6\u9700\u8981\u7684printData
\nreturnVal:\u64cd\u4f5c\u7c7b
\n*\/<\/span>
\nmyArrayOP*<\/span> myArrayUnpack<\/span>(<\/span>char<\/span> pack_use_max_size,<\/span>char<\/span>*<\/span> buf,<\/span>void<\/span>(<\/span>*<\/span>printData)<\/span>(<\/span>void<\/span>*<\/span>)<\/span>)<\/span>;<\/span>
\n#<\/span>endif<\/span><\/span><\/p>\n","protected":false},"excerpt":{"rendered":"

\u6587\u7ae0\u6d4f\u89c8\u9605\u8bfb684\u6b21\u3002\u3010\u4ee3\u7801\u3011\u7b80\u5355\u7684\u57fa\u4e8esqlite\u7684\u670d\u52a1\u5668\u548c\u5ba2\u6237\u7aef\u5b9e\u73b0\u3002<\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1],"tags":[2547,43],"topic":[],"class_list":["post-40619","post","type-post","status-publish","format-standard","hentry","category-server","tag-sqlite","tag-43"],"yoast_head":"\n\u7b80\u5355\u7684\u57fa\u4e8esqlite\u7684\u670d\u52a1\u5668\u548c\u5ba2\u6237\u7aef\u5b9e\u73b0 - \u7f51\u7855\u4e92\u8054\u5e2e\u52a9\u4e2d\u5fc3<\/title>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/www.wsisp.com\/helps\/40619.html\" \/>\n<meta property=\"og:locale\" content=\"zh_CN\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"\u7b80\u5355\u7684\u57fa\u4e8esqlite\u7684\u670d\u52a1\u5668\u548c\u5ba2\u6237\u7aef\u5b9e\u73b0 - \u7f51\u7855\u4e92\u8054\u5e2e\u52a9\u4e2d\u5fc3\" \/>\n<meta property=\"og:description\" content=\"\u6587\u7ae0\u6d4f\u89c8\u9605\u8bfb684\u6b21\u3002\u3010\u4ee3\u7801\u3011\u7b80\u5355\u7684\u57fa\u4e8esqlite\u7684\u670d\u52a1\u5668\u548c\u5ba2\u6237\u7aef\u5b9e\u73b0\u3002\" \/>\n<meta property=\"og:url\" content=\"https:\/\/www.wsisp.com\/helps\/40619.html\" \/>\n<meta property=\"og:site_name\" content=\"\u7f51\u7855\u4e92\u8054\u5e2e\u52a9\u4e2d\u5fc3\" \/>\n<meta property=\"article:published_time\" content=\"2025-05-29T13:46:35+00:00\" \/>\n<meta name=\"author\" content=\"admin\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:label1\" content=\"\u4f5c\u8005\" \/>\n\t<meta name=\"twitter:data1\" content=\"admin\" \/>\n\t<meta name=\"twitter:label2\" content=\"\u9884\u8ba1\u9605\u8bfb\u65f6\u95f4\" \/>\n\t<meta name=\"twitter:data2\" content=\"31 \u5206\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"WebPage\",\"@id\":\"https:\/\/www.wsisp.com\/helps\/40619.html\",\"url\":\"https:\/\/www.wsisp.com\/helps\/40619.html\",\"name\":\"\u7b80\u5355\u7684\u57fa\u4e8esqlite\u7684\u670d\u52a1\u5668\u548c\u5ba2\u6237\u7aef\u5b9e\u73b0 - \u7f51\u7855\u4e92\u8054\u5e2e\u52a9\u4e2d\u5fc3\",\"isPartOf\":{\"@id\":\"https:\/\/www.wsisp.com\/helps\/#website\"},\"datePublished\":\"2025-05-29T13:46:35+00:00\",\"dateModified\":\"2025-05-29T13:46:35+00:00\",\"author\":{\"@id\":\"https:\/\/www.wsisp.com\/helps\/#\/schema\/person\/358e386c577a3ab51c4493330a20ad41\"},\"breadcrumb\":{\"@id\":\"https:\/\/www.wsisp.com\/helps\/40619.html#breadcrumb\"},\"inLanguage\":\"zh-Hans\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/www.wsisp.com\/helps\/40619.html\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/www.wsisp.com\/helps\/40619.html#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"\u9996\u9875\",\"item\":\"https:\/\/www.wsisp.com\/helps\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"\u7b80\u5355\u7684\u57fa\u4e8esqlite\u7684\u670d\u52a1\u5668\u548c\u5ba2\u6237\u7aef\u5b9e\u73b0\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\/\/www.wsisp.com\/helps\/#website\",\"url\":\"https:\/\/www.wsisp.com\/helps\/\",\"name\":\"\u7f51\u7855\u4e92\u8054\u5e2e\u52a9\u4e2d\u5fc3\",\"description\":\"\u9999\u6e2f\u670d\u52a1\u5668_\u9999\u6e2f\u4e91\u670d\u52a1\u5668\u8d44\u8baf_\u670d\u52a1\u5668\u5e2e\u52a9\u6587\u6863_\u670d\u52a1\u5668\u6559\u7a0b\",\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\/\/www.wsisp.com\/helps\/?s={search_term_string}\"},\"query-input\":\"required name=search_term_string\"}],\"inLanguage\":\"zh-Hans\"},{\"@type\":\"Person\",\"@id\":\"https:\/\/www.wsisp.com\/helps\/#\/schema\/person\/358e386c577a3ab51c4493330a20ad41\",\"name\":\"admin\",\"image\":{\"@type\":\"ImageObject\",\"inLanguage\":\"zh-Hans\",\"@id\":\"https:\/\/www.wsisp.com\/helps\/#\/schema\/person\/image\/\",\"url\":\"https:\/\/gravatar.wp-china-yes.net\/avatar\/?s=96&d=mystery\",\"contentUrl\":\"https:\/\/gravatar.wp-china-yes.net\/avatar\/?s=96&d=mystery\",\"caption\":\"admin\"},\"sameAs\":[\"http:\/\/wp.wsisp.com\"],\"url\":\"https:\/\/www.wsisp.com\/helps\/author\/admin\"}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"\u7b80\u5355\u7684\u57fa\u4e8esqlite\u7684\u670d\u52a1\u5668\u548c\u5ba2\u6237\u7aef\u5b9e\u73b0 - \u7f51\u7855\u4e92\u8054\u5e2e\u52a9\u4e2d\u5fc3","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/www.wsisp.com\/helps\/40619.html","og_locale":"zh_CN","og_type":"article","og_title":"\u7b80\u5355\u7684\u57fa\u4e8esqlite\u7684\u670d\u52a1\u5668\u548c\u5ba2\u6237\u7aef\u5b9e\u73b0 - \u7f51\u7855\u4e92\u8054\u5e2e\u52a9\u4e2d\u5fc3","og_description":"\u6587\u7ae0\u6d4f\u89c8\u9605\u8bfb684\u6b21\u3002\u3010\u4ee3\u7801\u3011\u7b80\u5355\u7684\u57fa\u4e8esqlite\u7684\u670d\u52a1\u5668\u548c\u5ba2\u6237\u7aef\u5b9e\u73b0\u3002","og_url":"https:\/\/www.wsisp.com\/helps\/40619.html","og_site_name":"\u7f51\u7855\u4e92\u8054\u5e2e\u52a9\u4e2d\u5fc3","article_published_time":"2025-05-29T13:46:35+00:00","author":"admin","twitter_card":"summary_large_image","twitter_misc":{"\u4f5c\u8005":"admin","\u9884\u8ba1\u9605\u8bfb\u65f6\u95f4":"31 \u5206"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"WebPage","@id":"https:\/\/www.wsisp.com\/helps\/40619.html","url":"https:\/\/www.wsisp.com\/helps\/40619.html","name":"\u7b80\u5355\u7684\u57fa\u4e8esqlite\u7684\u670d\u52a1\u5668\u548c\u5ba2\u6237\u7aef\u5b9e\u73b0 - \u7f51\u7855\u4e92\u8054\u5e2e\u52a9\u4e2d\u5fc3","isPartOf":{"@id":"https:\/\/www.wsisp.com\/helps\/#website"},"datePublished":"2025-05-29T13:46:35+00:00","dateModified":"2025-05-29T13:46:35+00:00","author":{"@id":"https:\/\/www.wsisp.com\/helps\/#\/schema\/person\/358e386c577a3ab51c4493330a20ad41"},"breadcrumb":{"@id":"https:\/\/www.wsisp.com\/helps\/40619.html#breadcrumb"},"inLanguage":"zh-Hans","potentialAction":[{"@type":"ReadAction","target":["https:\/\/www.wsisp.com\/helps\/40619.html"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/www.wsisp.com\/helps\/40619.html#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"\u9996\u9875","item":"https:\/\/www.wsisp.com\/helps"},{"@type":"ListItem","position":2,"name":"\u7b80\u5355\u7684\u57fa\u4e8esqlite\u7684\u670d\u52a1\u5668\u548c\u5ba2\u6237\u7aef\u5b9e\u73b0"}]},{"@type":"WebSite","@id":"https:\/\/www.wsisp.com\/helps\/#website","url":"https:\/\/www.wsisp.com\/helps\/","name":"\u7f51\u7855\u4e92\u8054\u5e2e\u52a9\u4e2d\u5fc3","description":"\u9999\u6e2f\u670d\u52a1\u5668_\u9999\u6e2f\u4e91\u670d\u52a1\u5668\u8d44\u8baf_\u670d\u52a1\u5668\u5e2e\u52a9\u6587\u6863_\u670d\u52a1\u5668\u6559\u7a0b","potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/www.wsisp.com\/helps\/?s={search_term_string}"},"query-input":"required name=search_term_string"}],"inLanguage":"zh-Hans"},{"@type":"Person","@id":"https:\/\/www.wsisp.com\/helps\/#\/schema\/person\/358e386c577a3ab51c4493330a20ad41","name":"admin","image":{"@type":"ImageObject","inLanguage":"zh-Hans","@id":"https:\/\/www.wsisp.com\/helps\/#\/schema\/person\/image\/","url":"https:\/\/gravatar.wp-china-yes.net\/avatar\/?s=96&d=mystery","contentUrl":"https:\/\/gravatar.wp-china-yes.net\/avatar\/?s=96&d=mystery","caption":"admin"},"sameAs":["http:\/\/wp.wsisp.com"],"url":"https:\/\/www.wsisp.com\/helps\/author\/admin"}]}},"_links":{"self":[{"href":"https:\/\/www.wsisp.com\/helps\/wp-json\/wp\/v2\/posts\/40619","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.wsisp.com\/helps\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.wsisp.com\/helps\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.wsisp.com\/helps\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/www.wsisp.com\/helps\/wp-json\/wp\/v2\/comments?post=40619"}],"version-history":[{"count":0,"href":"https:\/\/www.wsisp.com\/helps\/wp-json\/wp\/v2\/posts\/40619\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.wsisp.com\/helps\/wp-json\/wp\/v2\/media?parent=40619"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.wsisp.com\/helps\/wp-json\/wp\/v2\/categories?post=40619"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.wsisp.com\/helps\/wp-json\/wp\/v2\/tags?post=40619"},{"taxonomy":"topic","embeddable":true,"href":"https:\/\/www.wsisp.com\/helps\/wp-json\/wp\/v2\/topic?post=40619"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}