CS考试辅导 VS2010 or gcc 4.3+

Redistribution and use in source and binary forms, with or without

modification, are permitted provided that the following conditions are met:

* Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.

THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS “AS
IS” AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A
PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER
OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

#ifndef UTLIST_H
#define UTLIST_H

#define UTLIST_VERSION 1.9.9

#include

* This file contains macros to manipulate singly and doubly-linked lists.
* 1. LL_ macros: singly-linked lists.
* 2. DL_ macros: doubly-linked lists.
* 3. CDL_ macros: circular doubly-linked lists.
* To use singly-linked lists, your structure must have a “next” pointer.
* To use doubly-linked lists, your structure must “prev” and “next” pointers.
* Either way, the pointer to the head of the list must be initialized to NULL.
* —————-.EXAMPLE ————————-
* struct item {
* int id;
* struct item *prev, *next;
* struct item *list = NULL:
* int main() {
* struct item *item;
* … allocate and populate item …
* DL_APPEND(list, item);
* ————————————————–
* For doubly-linked lists, the append and delete macros are O(1)
* For singly-linked lists, append and delete are O(n) but prepend is O(1)
* The sort macro is O(n log(n)) for all types of single/double/circular lists.

/* These macros use decltype or the earlier __typeof GNU extension.
As decltype is only available in newer compilers (VS2010 or gcc 4.3+
when compiling c++ code), this code uses whatever method is needed
or, for VS2008 where neither is available, uses casting workarounds. */
#ifdef _MSC_VER /* MS compiler */
#if _MSC_VER >= 1600 && defined(__cplusplus) /* VS2010 or newer in C++ mode */
#define LDECLTYPE(x) decltype(x)
#else /* VS2008 or older (or VS2010 in C mode) */
#define NO_DECLTYPE
#define LDECLTYPE(x) char *
#elif defined(__ICCARM__)
#define NO_DECLTYPE
#define LDECLTYPE(x) char *
#else /* GNU, Sun and other compilers */
#define LDECLTYPE(x) __typeof(x)

/* for VS2008 we use some workarounds to get around the lack of decltype,
* namely, we always reassign our tmp variable to the list head if we need
* to dereference its prev/next pointers, and save/restore the real head.*/
#ifdef NO_DECLTYPE
#define _SV(elt, list) \
_tmp = (char *)(list); \
{ \
char **_alias = (char **)&(list); \
*_alias = (elt); \
#define _NEXT(elt, list, next) ((char *)((list)->next))
#define _NEXTASGN(elt, list, to, next) \
{ \
char **_alias = (char **)&((list)->next); \
*_alias = (char *)(to); \
/* #define _PREV(elt,list,prev) ((char*)((list)->prev)) */
#define _PREVASGN(elt, list, to, prev) \
{ \
char **_alias = (char **)&((list)->prev); \
*_alias = (char *)(to); \
#define _RS(list) \
{ \
char **_alias = (char **)&(list); \
*_alias = _tmp; \
#define _CASTASGN(a, b) \
{ \
char **_alias = (char **)&(a); \
*_alias = (char *)(b); \
#define _SV(elt, list)
#define _NEXT(elt, list, next) ((elt)->next)
#define _NEXTASGN(elt, list, to, next) ((elt)->next) = (to)
/* #define _PREV(elt,list,prev) ((elt)->prev) */
#define _PREVASGN(elt, list, to, prev) ((elt)->prev) = (to)
#define _RS(list)
#define _CASTASGN(a, b) (a) = (b)

/******************************************************************************
* The sort macro is an adaptation of ‘s O(n log(n)) mergesort *
* Unwieldy variable names used here to avoid shadowing passed-in variables. *
*****************************************************************************/
#define LL_SORT(list, cmp) LL_SORT2(list, cmp, next)

#define LL_SORT2(list, cmp, next) do { LDECLTYPE(list) _ls_p; LDECLTYPE(list) _ls_q; LDECLTYPE(list) _ls_e; LDECLTYPE(list) _ls_tail; int _ls_insize, if (list) { _ls_insize = 1; _ls_looping = 1; while (_ls_looping) { _CASTASGN(_ls_p, list); list = NULL; _ls_tail = NULL; _ls_nmerges = 0; while (_ls_p) { _ls_nmerges++; _ls_q = _ls_p; _ls_psize = 0; for (_ls_i _ls_psize++; _SV(_ls_q, list); _ls_q = _RS(list); if (!_ls_q) break; } _ls_qsize = _ls_insize; while (_ls_psize if (_ls_psize == 0) { _ls_e = _ls_q; _SV(_ls_q, list); _ls_q _RS(list); _ls_qsize–; } else _ls_e = _ls_p; _SV(_ls_p, list); _ls_p _RS(list); _ls_psize–; } else _ls_e = _ls_p; _SV(_ls_p, list); _ls_p _RS(list); _ls_psize--; } else { _ls_e = _ls_q; _SV(_ls_q, list); _ls_q _RS(list); _ls_qsize--; } if (_ls_tail) { _SV(_ls_tail, list); _NEXTASGN(_ls_tail, _RS(list); } else { _CASTASGN(list, _ls_e); } _ls_tail = _ls_e; } _ls_p = _ls_q; } if (_ls_tail) { _SV(_ls_tail, list); _NEXTASGN(_ls_tail, _RS(list); } if (_ls_nmerges <= 1) { _ls_looping = 0; } _ls_insize *= 2; } } } while (0) #define DL_SORT(list, #define DL_SORT2(list, cmp, prev, next) do { LDECLTYPE(list) _ls_p; LDECLTYPE(list) _ls_q; LDECLTYPE(list) _ls_e; LDECLTYPE(list) _ls_tail; int _ls_insize, if (list) { _ls_insize = 1; _ls_looping = 1; while (_ls_looping) { _CASTASGN(_ls_p, list); list = NULL; _ls_tail = NULL; _ls_nmerges = 0; while (_ls_p) { _ls_nmerges++; _ls_q = _ls_p; _ls_psize = 0; for (_ls_i _ls_psize++; _SV(_ls_q, list); _ls_q = _RS(list); if (!_ls_q) break; } _ls_qsize = _ls_insize; while (_ls_psize if (_ls_psize == 0) { _ls_e = _ls_q; _SV(_ls_q, list); _ls_q _RS(list); _ls_qsize–; } else _ls_e = _ls_p; _SV(_ls_p, list); _ls_p _RS(list); _ls_psize–; } else _ls_e = _ls_p; _SV(_ls_p, list); _ls_p _RS(list); _ls_psize--; } else { _ls_e = _ls_q; _SV(_ls_q, list); _ls_q _RS(list); _ls_qsize--; } if (_ls_tail) { _SV(_ls_tail, list); _NEXTASGN(_ls_tail, _RS(list); } else { _CASTASGN(list, _ls_e); 程序代写 CS代考加微信: powcoder QQ: 1823890830 Email: powcoder@163.com

Related Posts