• <ins id="pjuwb"></ins>
    <blockquote id="pjuwb"><pre id="pjuwb"></pre></blockquote>
    <noscript id="pjuwb"></noscript>
          <sup id="pjuwb"><pre id="pjuwb"></pre></sup>
            <dd id="pjuwb"></dd>
            <abbr id="pjuwb"></abbr>

            牽著老婆滿街逛

            嚴以律己,寬以待人. 三思而后行.
            GMail/GTalk: yanglinbo#google.com;
            MSN/Email: tx7do#yahoo.com.cn;
            QQ: 3 0 3 3 9 6 9 2 0 .

            TAILQ Example

            from:http://unx.ca/log/2006/08/19/tailq-example/

            I plan to use this blog to post codebits that I find myself sending to people over and over again. The first example is how to use a TAILQ from sys/queue.h found on the BSDs. Many Linux distributions also have sys/queue.h but may be missing certain macros such as TAILQ_FOREACH(). At the very least I hope this enticies some newer C programmer to use queue.h rather than rolling their own linked list. I’ll jump directly to the code as I feel it is more or less self explanatory.

            The following code can be downloaded here.

            /*
             * TAILQ example program.
             */
            #include <stdlib.h>
            #include <stdio.h>
            /*
             * On many OpenBSD/NetBSD/FreeBSD you could include <sys/queue.h>, but
             * for portability we’ll include the local copy.
             */
            #include "queue.h"
            /*
             * This structure defines each item in our tail queue.  It must also
             * contain an item (TAILQ_ENTRY) that points to the next and previous
             * items in the tail queue.
             *
             * For simplicity, we will be creating a list of integers.
             */
            struct tailq_entry {
            int value;
            /*
                     * This holds the pointers to the next and previous entries in
                     * the tail queue.
                     */
            TAILQ_ENTRY(tailq_entry) entries;
            };
            /*
             * Our tail queue requires a head, this is defined using the
             * TAILQ_HEAD macro.
             */
            TAILQ_HEAD(, tailq_entry) my_tailq_head;
            int
            main(int argc, char **argv)
            {
            /* Define a pointer to an item in the tail queue. */
            struct tailq_entry *item;
            /* In some cases we have to track a temporary item. */
            struct tailq_entry *tmp_item;
            int i;
            /* Initialize the tail queue. */
            TAILQ_INIT(&my_tailq_head);
            /* Add 10 items to the tailq queue. */
            for (i = 0; i < 10; i++) {
            /*
                             * Each item we want to add to the tail queue must be
                             * allocated.
                             */
            item = malloc(sizeof(*item));
            if (item == NULL) {
            perror("malloc failed");
            exit(EXIT_FAILURE);
            }
            /* Set the value. */
            item->value = i;
            /*
                             * Add our item to the end of tail queue. The first
                             * argument is a pointer to the head of our tail
                             * queue, the second is the item we want to add, and
                             * the third argument is the name of the struct
                             * variable that points to the next and previous items
                             * in the tail queue.
                             */
            TAILQ_INSERT_TAIL(&my_tailq_head, item, entries);
            }
            /* Traverse the tail queue forward. */
            printf("Forward traversal: ");
            TAILQ_FOREACH(item, &my_tailq_head, entries) {
            printf("%d ", item->value);
            }
            printf("n");
            /* Insert a new item after the item with value 5. */
            printf("Adding new item after 5: ");
            TAILQ_FOREACH(item, &my_tailq_head, entries) {
            if (item->value == 5) {
            struct tailq_entry *new_item =
            malloc(sizeof(*new_item));
            if (new_item == NULL) {
            perror("malloc failed");
            exit(EXIT_FAILURE);
            }
            new_item->value = 10;
            TAILQ_INSERT_AFTER(&my_tailq_head, item, new_item,
            entries);
            break;
            }
            }
            /* Do another forward traversal to show the newly added item. */
            TAILQ_FOREACH(item, &my_tailq_head, entries) {
            printf("%d ", item->value);
            }
            printf("n");
            /*
                     * Delete the item with the value 3.
                     *
                     * We can’t use TAILQ_FOREACH here as TAILQ_FOREACH is not
                     * safe against deletions during the traversal.  Some variants
                     * of queue.h have TAILQ_FOREACH_MUTABLE or TAILQ_FOREACH_SAFE
                     * which are safe against deletions.
                     */
            printf("Deleting item with value 3: ");
            for (item = TAILQ_FIRST(&my_tailq_head); item != NULL; item = tmp_item)
            {
            tmp_item = TAILQ_NEXT(item, entries);
            if (item->value == 3) {
            /* Remove the item from the tail queue. */
            TAILQ_REMOVE(&my_tailq_head, item, entries);
            /* Free the item as we don’t need it anymore. */
            free(item);
            break;
            }
            }
            /* Another forward traversal to show that the value 3 is now gone. */
            TAILQ_FOREACH(item, &my_tailq_head, entries) {
            printf("%d ", item->value);
            }
            printf("n");
            /* Free the entire tail queue. */
            while (item = TAILQ_FIRST(&my_tailq_head)) {
            TAILQ_REMOVE(&my_tailq_head, item, entries);
            free(item);
            }
            /* The tail queue should now be empty. */
            if (!TAILQ_EMPTY(&my_tailq_head))
            printf("tail queue is NOT empty!n");
            return 0;
            }
            

            posted on 2007-08-21 01:45 楊粼波 閱讀(1237) 評論(0)  編輯 收藏 引用

            伊人久久大香线蕉成人| 久久精品亚洲乱码伦伦中文 | 91精品日韩人妻无码久久不卡| 国产精品久久亚洲不卡动漫| 成人国内精品久久久久影院VR| 日韩欧美亚洲国产精品字幕久久久| 久久久久久国产精品无码下载 | 久久国产高清一区二区三区| 久久久久久青草大香综合精品| 久久99热这里只有精品国产| 99久久夜色精品国产网站| 国内精品久久久久影院亚洲| 国产精品一区二区久久精品| 免费精品久久天干天干| 国产真实乱对白精彩久久| 久久精品国产99久久无毒不卡| 香蕉久久影院| 国产亚州精品女人久久久久久| 亚洲精品乱码久久久久久| 久久久久婷婷| 精品久久人人妻人人做精品| 波多野结衣中文字幕久久| 精品综合久久久久久98| 中文字幕精品久久久久人妻| 久久久国产精华液| 99久久综合狠狠综合久久| 国内精品久久九九国产精品| 午夜天堂av天堂久久久| 精品久久久无码21p发布 | 99国产精品久久| 国产欧美久久一区二区| 91精品国产综合久久婷婷| 久久国产精品77777| 亚洲国产另类久久久精品| 久久久久久国产精品无码下载| 伊人热热久久原色播放www| 亚洲午夜精品久久久久久app| 欧美激情精品久久久久久久| 综合久久给合久久狠狠狠97色| 性高朝久久久久久久久久| 一本久久综合亚洲鲁鲁五月天亚洲欧美一区二区 |