libgivaro-dev 3.2.13-1.2 / usr / include / givaro / givlist0.inl

This file is indexed.

/usr/include/givaro/givlist0.inl is in libgivaro-dev 3.2.13-1.2.

This file is owned by root:root, with mode 0o644.

The actual contents of the file can be viewed below. 

  1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
// ==========================================================================
// $Source: /var/lib/cvs/Givaro/src/kernel/bstruct/givlist0.inl,v $
// Copyright(c)'94-97 by Givaro Team
// see the copyright file.
// Author: T. Gautier
// $Id: givlist0.inl,v 1.1.1.1 2004/05/12 16:08:24 jgdumas Exp $
// ==========================================================================
// inline implementation of the List0 methods

template <class T>
inline List0<T>::List0() 
 : _head(0), _queue(0), _size(0)
{}

template <class T>
inline List0<T>::List0( const List0<T>& l) 
 : _head(l._head), _queue(l._queue), _size(l._size)
{
  node* curr = _head;
  while (curr !=0) {
    curr->cnt++ ;
    curr = curr->next ; 
  }
}

template <class T>
inline void List0<T>::destroy()
{
  node* curr = _head;
  while (curr !=0) {
    node* tmp = curr->next ;
    if (--*(curr->cnt) ==0) {
      GivaroMM<node>::destroy(curr,1);
      GivaroMM<node>::desallocate(curr,1);
    }
    curr = tmp ;
  }
  _head = _queue = 0 ;
  _size = 0 ;
}

template <class T>
inline List0<T>::~List0()
{ destroy() ; }

template <class T>
inline List0<T>& List0<T>::copy(const List0<T>& l)
{
  destroy();
  node* curr = l._head ;
  while (curr !=0) {
   this->insertlast( *(curr->item) );
   curr = curr->next ;
  }
  return *this;
}

template <class T>
inline List0<T>& List0<T>::logcopy(const List0<T>& l)
{
  destroy();
  _head = l._head;
  _queue = l._queue;
  _size = l._size ;
  node* curr = _head;
  while (curr !=0) {
    curr->cnt++ ;
    curr = curr->next ; 
  }
  return *this;
}

template <class T>
inline List0<T>& List0<T>::operator=(const List0<T>& l)
{ return logcpy(l); }

template <class T>
inline  size_t List0<T>::size() const
{ return _size ; }

template <class T>
inline  int List0<T>::is_empty() const
{ return _size ==0; }

template<class T>
void List0<T>::insertlast( const T& val)
{
  node* curr = GivaroMM<node>::allocate(1);
  curr->cnt =  GivaroMM<int>::allocate(1); *(curr->cnt) = 1 ;
  curr->item = GivaroMM<T>::allocate(1);
  GivaroMM<T>::initone(curr->item, val);
  curr->prev = _queue ; 
  curr->next = 0;
  if (_queue !=0) _queue->next = curr ; 
  _queue = curr ;
  if (_head ==0) _head = curr ;
  _size++ ;
}

template<class T>
void List0<T>::insertfirst( const T& val)
{
  node* curr = GivaroMM<node>::allocate(1);
  curr->cnt =  GivaroMM<int>::allocate(1); *(curr->cnt) = 1 ;
  curr->item = GivaroMM<T>::allocate(1);
  GivaroMM<T>::initone(curr->item, val);
  curr->prev = 0;
  curr->next = _head;
  if (_head !=0) _head->prev = curr ; 
  _head = curr ;
  if (_queue ==0) _queue = curr ;
  _size++ ;
}

template<class T>
int List0<T>::getlast(T& val) const
{
  if (_queue ==0) return 0;
  val = *(_queue->item);
  return 1;
}

template<class T>
int List0<T>::getfirst(T& val) const
{
  if (_head ==0) return 0;
  val = *(_head->item);
  return 1;
}

template<class T>
int List0<T>::getrmvlast(T& val) 
{
  if (_queue ==0) return 0;
  node* curr = _queue;
  val = *(curr->item);
  _queue = curr->prev;
  if (_queue !=0) _queue->next = 0;
  else _head = 0 ; // one item in the list !
  if (--*(curr->cnt) ==0) {
    GivaroMM<node>::destroy(curr,1);
    GivaroMM<node>::desallocate(curr,1);
  }
  --_size;
  return 1;
}

template<class T>
int List0<T>::getrmvfirst(T& val) 
{
  if (_head ==0) return 0;
  node* curr = _head;
  val = *(curr->item);
  _head = curr->next;
  if (_head !=0) _head->prev = 0;
  else _queue = 0 ; // one item in the list !
  if (--*(curr->cnt) ==0) {
    GivaroMM<node>::destroy(curr,1);
    GivaroMM<node>::desallocate(curr,1);
  }
  --_size;
  return 1;
}

APT Browse - Built by Thomas Orozco.