lista.c

Go to the documentation of this file.

/***************************************************************************
 *   Copyright (C) 2008 by Mateus "Zarnick" Interciso                      *
 *   zarnick@geekvault.org                                                 *
 *                                                                         *
 *   This program is free software; you can redistribute it and/or modify  *
 *   it under the terms of the GNU General Public License as published by  *
 *   the Free Software Foundation; either version 3 of the License, or     *
 *   (at your option) any later version.                                   *
 *                                                                         *
 *   This program 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 General Public License for more details.                          *
 *                                                                         *
 *   You should have received a copy of the GNU General Public License     *
 *   along with this program; if not, write to the                         *
 *   Free Software Foundation, Inc.,                                       *
 *   59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.             *
 ***************************************************************************/
#include "lista.h"

unsigned long int size(node *l){
  node *start = l;
  unsigned long int size = 0;
  if(l==NULL) return 0;
  while(l->prev!=NULL) l=l->prev;
  while(l->next!=NULL){
    l=l->next;
    size++;
  }
  l=start;
  size++;
  return size;
}

void add_node(node *l, int num){
  assert(l!=NULL);
  node *new = NULL;
  node *start = l;
  if((new=(node*)malloc(sizeof(node)))==NULL){
    perror("malloc");
    exit(EXIT_FAILURE);
  }
  memset(new,'\0',sizeof(node));
  new->num = num;
  while(l->next!=NULL)
    l=l->next;

  l->next   = new;
  new->prev = l;
  l=start;
}

node *search(node *l, int num){
  node *ret = NULL;
  while(l!=NULL){
    if(l->num==num) ret=l;
    l=l->next;
  }
  return ret;
}

node *rem_node(node *l, int num){
  assert(l!=NULL);
  node *rem = search(l,num);
  node *tmp = NULL;
  if(rem==l){
    tmp = l;
    l=l->next;
    l->prev = NULL;
    free(tmp);
    return l;
  }
  if(rem!=NULL){
    tmp=rem->prev;
    if(rem->next!=NULL){
      tmp->next=rem->next;
      rem->next->prev = tmp;
    }
    else
      tmp->next=NULL;
    free(rem);
  }
  return l;
}

void add_after(node *n, int num){
  assert(n!=NULL);
  node *new = NULL;
  if((new=(node*)malloc(sizeof(node)))==NULL){
    perror("malloc");
    exit(EXIT_FAILURE);
  }
  memset(new,'\0',sizeof(node));
  new->num  = num;
  new->prev = n;
  new->next = n->next;
  n->next   = new;
}

void delete_list(node *l){
  node *tmp = NULL;
  while(l->next!=NULL){
    tmp=l;
    l=l->next;
    free(tmp);
    tmp=NULL;
  }
  free(l);
  l=NULL;
}

---