/home/christophe/src/fulguro/trunk/src/datatools/flgrDataToolsList.c

/****************************************************************
 * Fulguro
 * Copyright (C) 2004 Christophe Clienti
 *
 * This library is free software; you can redistribute it and/or
 * modify it under the terms of the GNU Lesser General Public
 * License as published by the Free Software Foundation; either
 * version 2 of the License, or (at your option) any later version.
 *
 * This library is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
 * Lesser General Public License for more details.
 *
 * You should have received a copy of the GNU Lesser General Public
 * License along with this library; if not, write to the
 * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
 * Boston, MA 02111-1307, USA.
 ***************************************************************/

#include <stdio.h> 
#include <stdlib.h>
#include <flgrCoreMalloc.h>
#include <flgrCoreDispatch.h>
#include "flgrDataToolsList.h" 
 



int flgr_list_is_empty(FLGR_List *list) { 
  
  
  if((list->start == NULL) && (list->end == NULL)) { 
    return 1; 
  }else { 
    return 0; 
  } 
} 



int flgr_list_size(FLGR_List *list) { 
  
  
  return list->nbelt; 
} 
 


FLGR_List *flgr_list_create() { 
  FLGR_List *list=flgr_malloc(sizeof(FLGR_List));
  
  
  list->start = list->end = NULL; 
  list->nbelt = 0; 
  return list;
}
 


void flgr_list_add_head(FLGR_List *list,void *elt) { 
  TLink *p; 
 
  
  
  p = (TLink *) flgr_malloc(sizeof(TLink));
  p->elt = elt; 
  p->previous = NULL; 
   
  if(list->nbelt == 0) { 
    p->next = NULL; 
    list->start = list->end = p; 
    list->nbelt = 1; 
  }else { 
    list->start->previous = p; 
    p->next = list->start; 
    list->start = p; 
    list->nbelt++; 
  } 
} 



void flgr_list_add_tail(FLGR_List *list,void *elt) { 
  TLink *p; 
 
  
  
  p = (TLink *) flgr_malloc(sizeof(TLink)); 
  p->elt = elt; 
  p->next = NULL; 
 
  if(list->nbelt == 0) { 
    list->start = list->end = p; 
    p->previous = NULL; 
    list->nbelt = 1; 
  }else { 
    p->previous = list->end; 
    list->end->next = p; 
    list->end = p; 
    p->next = NULL; 
    list->nbelt++; 
  } 
} 
 


void flgr_list_del_head(FLGR_List *list) { 
  TLink *p; 
 
  
  
  if(list->nbelt != 0) { 
    p = list->start;  
    if(list->nbelt == 1) { 
      list->start = list->end = NULL; 
      list->nbelt = 0; 
    }else { 
      list->start = list->start->next; 
      list->start->previous = NULL; 
      list->nbelt--; 
    } 
    flgr_free(p); 
  } 
} 
 


void flgr_list_del_tail(FLGR_List *list) { 
  TLink *p; 
  
  
  
  if(list->nbelt != 0) { 
    p = list->end; 
    if(list->nbelt == 1) { 
      list->start = list->end = NULL; 
      list->nbelt = 0; 
    }else { 
      list->end = list->end->previous; 
      list->end->next = NULL; 
      list->nbelt--; 
    } 
    flgr_free(p); 
  } 
} 
 


void flgr_list_destroy(FLGR_List *list) {  
  
  
  while(list->nbelt != 0) { 
    flgr_list_del_head(list); 
  } 
  flgr_free(list);
} 
 


void *flgr_list_get_head(FLGR_List *list) { 
  
  
  return list->start->elt; 
} 
 


void *flgr_list_get_tail(FLGR_List *list) { 
  
  
  return list->end->elt; 
} 




void flgr_list_stack_push(FLGR_List *list,void *elt) {
  
  
  flgr_list_add_head(list,elt);
}




void *flgr_list_stack_pop(FLGR_List *list) {
  void *elt=flgr_list_get_head(list);
  
  
  flgr_list_del_head(list);
  return elt;
}
  
  


void flgr_list_queue_add(FLGR_List *list,void *elt) {
  
  
  flgr_list_add_head(list,elt);
}




void *flgr_list_queue_get(FLGR_List *list) {
  void *elt=flgr_list_get_tail(list);
  
  
  flgr_list_del_tail(list);
  return elt;
}

---

---