lqr/lqr_carver_list.c

   1 /* LiquidRescaling Library
   2  * Copyright (C) 2007-2009 Carlo Baldassi (the "Author") <carlobaldassi@gmail.com>.
   3  * All Rights Reserved.
   4  *
   5  * This library implements the algorithm described in the paper
   6  * "Seam Carving for Content-Aware Image Resizing"
   7  * by Shai Avidan and Ariel Shamir
   8  * which can be found at http://www.faculty.idc.ac.il/arik/imret.pdf
   9  *
  10  * This program is free software; you can redistribute it and/or modify
  11  * it under the terms of the GNU Lesser General Public License as published by
  12  * the Free Software Foundation; version 3 dated June, 2007.
  13
  14  * This program is distributed in the hope that it will be useful,
  15  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  16  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  17  * GNU Lesser General Public License for more details.
  18
  19  * You should have received a copy of the GNU Lesser General Public License
  20  * along with this program; if not, see <http://www.gnu.org/licenses/>
  21  */
  22
  23 #include <glib.h>
  24
  25 #include <lqr/lqr_all.h>
  26
  27 #ifdef __LQR_DEBUG__
  28 #include <assert.h>
  29 #endif /* __LQR_DEBUG__ */
  30
  31
  32 /**** CARVER LIST FUNCTIONS ****/
  33
  34 LqrCarverList *
  35 lqr_carver_list_append (LqrCarverList * list, LqrCarver * r)
  36 {
  37   LqrCarverList * prev = NULL;
  38   LqrCarverList * now = list;
  39   while (now != NULL)
  40     {
  41       prev = now;
  42       now = now->next;
  43     }
  44   TRY_N_N (now = g_try_new(LqrCarverList, 1));
  45   now->next = NULL;
  46   now->current = r;
  47   if (prev)
  48     {
  49       prev->next = now;
  50     }
  51   if (list == NULL)
  52     {
  53       return now;
  54     }
  55   else
  56     {
  57       return list;
  58     }
  59 }
  60
  61 void
  62 lqr_carver_list_destroy(LqrCarverList * list)
  63 {
  64   LqrCarverList * now = list;
  65   if (now != NULL)
  66     {
  67       lqr_carver_list_destroy(now->next);
  68       lqr_carver_list_destroy(now->current->attached_list);
  69       lqr_carver_destroy(now->current);
  70     }
  71 }
  72
  73 LQR_PUBLIC
  74 LqrCarverList *
  75 lqr_carver_list_start (LqrCarver *r)
  76 {
  77   return r->attached_list;
  78 }
  79
  80 LQR_PUBLIC
  81 LqrCarverList *
  82 lqr_carver_list_next (LqrCarverList * list)
  83 {
  84   TRY_N_N (list);
  85   return list->next;
  86 }
  87
  88 LQR_PUBLIC
  89 LqrCarver *
  90 lqr_carver_list_current (LqrCarverList * list)
  91 {
  92   TRY_N_N (list);
  93   return list->current;
  94 }
  95
  96 LQR_PUBLIC
  97 LqrRetVal
  98 lqr_carver_list_foreach (LqrCarverList * list, LqrCarverFunc func, LqrDataTok data)
  99 {
 100   LqrCarverList * now = list;
 101   if (now != NULL)
 102     {
 103       CATCH (func(now->current, data));
 104       return lqr_carver_list_foreach (now->next, func, data);
 105     }
 106   return LQR_OK;
 107 }
 108
 109 LQR_PUBLIC
 110 LqrRetVal
 111 lqr_carver_list_foreach_recursive (LqrCarverList * list, LqrCarverFunc func, LqrDataTok data)
 112 {
 113   LqrCarverList * now = list;
 114   if (now != NULL)
 115     {
 116       CATCH (func(now->current, data));
 117       CATCH (lqr_carver_list_foreach (now->current->attached_list, func, data));
 118       return lqr_carver_list_foreach (now->next, func, data);
 119     }
 120   return LQR_OK;
 121 }
 122