dslinux/user/pixil/packages/dvdview/dvdview/oldlibgfx/libvideogfx/containers .cvsignore Makefile.am array.cc array.hh array2.cc array2.hh heap.cc heap.hh queue.cc queue.hh
amadeus
dslinux_amadeus at user.in-berlin.de
Tue Oct 3 13:25:49 CEST 2006
Update of /cvsroot/dslinux/dslinux/user/pixil/packages/dvdview/dvdview/oldlibgfx/libvideogfx/containers
In directory antilope:/tmp/cvs-serv11916/packages/dvdview/dvdview/oldlibgfx/libvideogfx/containers
Added Files:
.cvsignore Makefile.am array.cc array.hh array2.cc array2.hh
heap.cc heap.hh queue.cc queue.hh
Log Message:
adding pristine copy of pixil to HEAD so I can branch from it
--- NEW FILE: .cvsignore ---
Makefile
Makefile.in
*.lo
_libs
.libs
.deps
libvideogfx-containers.la
--- NEW FILE: queue.hh ---
/********************************************************************************
utility/queue.hh
purpose:
Queue container class template.
notes:
to do:
author(s):
- Dirk Farin, farin at ti.uni-mannheim.de
modifications:
29/Sep/1999 - Dirk Farin
- integrated into libvideogfx CVS
20/Nov/1998 - Dirk Farin
- new method: AskAndRemoveHead()
********************************************************************************
Copyright (C) 1999 Dirk Farin
This program is distributed under GNU Public License (GPL) as
outlined in the COPYING file that comes with the source distribution.
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 2 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
********************************************************************************/
#ifndef LIBVIDEOGFX_UTILITY_QUEUE_HH
#define LIBVIDEOGFX_UTILITY_QUEUE_HH
#include "libvideogfx/types.hh"
#include <assert.h>
template <class T> class Queue
{
public:
Queue();
~Queue();
void Append(const T&);
void AppendAtHead(const T&);
T& AskHead() const { assert(!IsEmpty()); assert(d_first<d_size); return d_queue[d_first]; }
T& AskTail() const;
T& AskFromHead(uint32 idx) const; // 0 is first one, 1 is second one
T& AskFromTail(uint32 idx) const; // 0 is last one, 1 is last but one
void RemoveHead();
void RemoveFromHead(uint32 idx);
T& AskAndRemoveHead() { T& x=AskHead(); RemoveHead(); return x; }
bool IsEmpty() const { return d_entries==0; }
uint32 Length() const { return d_entries; }
private:
T* d_queue;
int d_size;
int d_first;
int d_entries;
void Enlarge();
};
#endif
--- NEW FILE: array2.hh ---
/********************************************************************************
libvideogfx/containers/array2.hh
purpose:
Simple 2dim array class template.
notes:
to do:
author(s):
- Dirk Farin, farin at ti.uni-mannheim.de
modifications:
30/Sep/1999 - Dirk Farin
- integrated from old DVDview into ULib
********************************************************************************
Copyright (C) 1999 Dirk Farin
This program is distributed under GNU Public License (GPL) as
outlined in the COPYING file that comes with the source distribution.
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 2 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
********************************************************************************/
#ifndef LIBVIDEOGFX_CONTAINERS_ARRAY2_HH
#define LIBVIDEOGFX_CONTAINERS_ARRAY2_HH
#include "libvideogfx/types.hh"
template <class T> class Array2
{
public:
Array2();
Array2(int width,int height);
~Array2();
void Create(int width,int height);
bool IsInitialized() const { return d_array != NULL; }
T& Ask (int y,int x) { return d_array[y][x]; }
const T& Ask_const(int y,int x) const { return d_array[y][x]; }
int AskWidth() const { return d_width; }
int AskHeight() const { return d_height; }
private:
int d_width,d_height;
T** d_array;
};
#endif
--- NEW FILE: array.hh ---
/********************************************************************************
libvideogfx/containers/array.hh
purpose:
Simple 1dim array class template.
notes:
to do:
author(s):
- Dirk Farin, farin at ti.uni-mannheim.de
modifications:
19/Sep/2000 - Dirk Farin
- New method CreateRange()
30/Jun/2000 - Dirk Farin
- first implementation
********************************************************************************
Copyright (C) 1999 Dirk Farin
This program is distributed under GNU Public License (GPL) as
outlined in the COPYING file that comes with the source distribution.
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 2 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
********************************************************************************/
#ifndef LIBVIDEOGFX_CONTAINERS_ARRAY_HH
#define LIBVIDEOGFX_CONTAINERS_ARRAY_HH
#include "libvideogfx/types.hh"
template <class T> class Array
{
public:
Array();
Array(const Array<T>&);
Array(int size,int base=0);
~Array();
void Create(int size,int base=0);
void CreateRange(int first,int last) { Create(last-first+1,first); }
void Destroy();
bool IsInitialized() const { return d_array != NULL; }
T* Data() { return &d_array[d_baseoffset]; }
const T* Data_const() const { return &d_array[d_baseoffset]; }
int AskBase() const { return -d_baseoffset; }
int AskSize() const { return d_size; }
int AskStartIdx() const { return AskBase(); }
int AskEndIdx() const { return AskSize()+AskBase()-1; }
const Array& operator=(const Array<T>&);
private:
int d_baseoffset,d_size;
T* d_array;
};
#endif
--- NEW FILE: array2.cc ---
/********************************************************************************
Copyright (C) 1999 Dirk Farin
This program is distributed under GNU Public License (GPL) as
outlined in the COPYING file that comes with the source distribution.
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 2 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 "libvideogfx/containers/array2.hh"
template <class T> Array2<T>::Array2()
{
d_width = d_height = 0;
d_array = 0;
}
template <class T> Array2<T>::Array2(int width,int height)
{
Create(width,height);
}
template <class T> void Array2<T>::Create(int width,int height)
{
if (d_array)
{
if (d_width == width && d_height == height)
return;
delete[] d_array[0];
delete[] d_array;
}
d_width = width;
d_height = height;
T* bitmap = new T[d_width * d_height];
d_array = new T* [d_height];
{for (int y=0;y<d_height;y++)
d_array[y]= &bitmap[y*d_width];}
}
template <class T> Array2<T>::~Array2()
{
if (d_array)
{
delete[] d_array[0];
delete[] d_array;
}
}
--- NEW FILE: heap.cc ---
/********************************************************************************
Copyright (C) 1999 Dirk Farin
This program is distributed under GNU Public License (GPL) as
outlined in the COPYING file that comes with the source distribution.
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 2 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 "config.h"
#include <assert.h>
#include "heap.hh"
#define INITIAL_SIZE 50
template <class T> Heap<T>::Heap()
: d_heap(NULL), d_size(0), d_entries(0)
{
}
template <class T> Heap<T>::~Heap()
{
if (d_heap) delete[] d_heap;
}
template <class T> void Heap<T>::Insert(const T& e)
{
// If heap is full, allocate a bigger one and copy the old one into it.
if (d_entries==d_size)
{
int newsize = max(max(d_size*2,d_size+10),INITIAL_SIZE);
assert(newsize>d_size);
T* newheap = new T[newsize+1]; // Create array for new heap including an extra dummy element [0].
for (uint32 i=1;i<=d_entries;i++)
newheap[i] = d_heap[i];
if (d_heap) delete[] d_heap;
d_heap = newheap;
d_size = newsize;
}
d_entries++;
d_heap[d_entries] = e;
UpHeap(d_entries);
}
template <class T> void Heap<T>::UpHeap(int i)
{
while (i>1 && d_heap[i/2].AskValue() > d_heap[i].AskValue())
{
swap(d_heap[i],d_heap[i/2]);
i /= 2;
}
}
template <class T> void Heap<T>::RemoveTop()
{
d_heap[1] = d_heap[d_entries];
d_entries--;
DownHeap(1);
}
template <class T> void Heap<T>::DownHeap(int i)
{
again1:
// Element ist am unteren Rand.
if (i*2 > d_entries)
return;
if (i*2==d_entries ||
d_heap[i*2].AskValue() < d_heap[i*2+1].AskValue())
{
if (d_heap[i].AskValue() > d_heap[i*2].AskValue())
{
swap(d_heap[i],d_heap[i*2]);
i=i*2;
goto again1;
}
}
else
{
if (d_heap[i].AskValue() > d_heap[i*2+1].AskValue())
{
swap(d_heap[i],d_heap[i*2+1]);
i=i*2+1;
goto again1;
}
}
}
--- NEW FILE: array.cc ---
/********************************************************************************
Copyright (C) 1999 Dirk Farin
This program is distributed under GNU Public License (GPL) as
outlined in the COPYING file that comes with the source distribution.
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 2 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 "array.hh"
template <class T> Array<T>::Array()
: d_baseoffset(0),d_size(0), d_array(NULL)
{
}
template <class T> Array<T>::Array(int size,int base)
: d_array(NULL)
{
Create(size,base);
}
template <class T> Array<T>::Array(const Array<T>& a)
: d_array(NULL)
{
*this = a;
}
template <class T> void Array<T>::Create(int size,int base)
{
if (d_array)
{
if (d_size == size)
{
d_baseoffset = -base;
return;
}
delete[] d_array;
}
d_size = size;
d_baseoffset = -base;
d_array = new T[d_size];
}
template <class T> Array<T>::~Array()
{
Destroy();
}
template <class T> void Array<T>::Destroy()
{
if (d_array)
{
delete[] d_array;
}
d_array=NULL;
d_baseoffset=0;
d_size=0;
}
template <class T> const Array<T>& Array<T>::operator=(const Array<T>& a)
{
Destroy();
if (a.d_array)
{
Create(a.d_size, -a.d_baseoffset);
for (int i=0;i<d_size;i++)
d_array[i] = a.d_array[i];
}
return *this;
}
--- NEW FILE: queue.cc ---
/********************************************************************************
Copyright (C) 1999 Dirk Farin
This program is distributed under GNU Public License (GPL) as
outlined in the COPYING file that comes with the source distribution.
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 2 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 "libvideogfx/containers/queue.hh"
#include <assert.h>
#define INITIAL_SIZE 50
template <class T> Queue<T>::Queue()
: d_queue(NULL), d_size(0), d_entries(0)
{
}
template <class T> Queue<T>::~Queue()
{
if (d_queue) delete[] d_queue;
}
template <class T> void Queue<T>::Append(const T& e)
{
// If queue is full, allocate a bigger one and copy the old one into it.
if (d_entries==d_size)
{
Enlarge();
}
d_queue[ (d_first+d_entries)%d_size ] = e;
d_entries++;
}
template <class T> void Queue<T>::AppendAtHead(const T& e)
{
// If queue is full, allocate a bigger one and copy the old one into it.
if (d_entries==d_size)
{
Enlarge();
}
d_first = (d_first-1+d_size)%d_size;
d_queue[d_first] = e;
d_entries++;
}
template <class T> void Queue<T>::Enlarge()
{
int newsize = max(max(d_size*2,d_size+10),INITIAL_SIZE);
assert(newsize>d_size);
T* newqueue = new T[newsize];
for (uint32 i=0;i<d_entries;i++)
newqueue[i] = d_queue[(i+d_first)%d_size];
if (d_queue) delete[] d_queue;
d_queue = newqueue;
d_size = newsize;
d_first = 0;
}
template <class T> T& Queue<T>::AskTail() const
{
assert(!IsEmpty());
return d_queue[(d_first+d_entries-1)%d_size];
}
template <class T> T& Queue<T>::AskFromHead(uint32 idx) const
{
assert(!IsEmpty());
assert(idx<d_entries);
return d_queue[(d_first+idx)%d_size];
}
template <class T> T& Queue<T>::AskFromTail(uint32 idx) const
{
assert(!IsEmpty());
assert(idx<d_entries);
return d_queue[(d_first+d_entries-1-idx)%d_size];
}
template <class T> void Queue<T>::RemoveHead()
{
assert(!IsEmpty());
d_first++; d_first %= d_size;
d_entries--;
}
template <class T> void Queue<T>::RemoveFromHead(uint32 idx)
{
assert(!IsEmpty());
assert(idx<d_entries);
for (uint32 i=0;i<d_entries-idx-1;i++)
d_queue[(d_first+idx+i)%d_size] = d_queue[(d_first+idx+i+1)%d_size];
d_entries--;
}
--- NEW FILE: Makefile.am ---
## Makefile.am for libvideogfx/libvideogfx/containers
noinst_LTLIBRARIES = libvideogfx-containers.la
libvideogfx_containers_includedir = $(includedir)/libvideogfx/containers
# Header files for public installation (non-generated)
libvideogfx_containers_public_h_sources = \
heap.hh
# Header files that don't get installed
libvideogfx_containers_private_h_sources = \
array.hh \
array.cc \
array2.cc \
array2.hh \
queue.cc \
queue.hh
# C sources to build the library from
libvideogfx_containers_c_sources = \
heap.cc
#
# setup sources and their dependancies
#
libvideogfx_containers_include_HEADERS = $(libvideogfx_containers_public_h_sources)
libvideogfx_containers_la_SOURCES = $(libvideogfx_containers_c_sources)
EXTRA_HEADERS +=
EXTRA_DIST += $(libvideogfx_containers_private_h_sources)
INCLUDES = \
-I$(top_srcdir)
.PHONY: files
files:
@files=`ls $(DISTFILES) 2> /dev/null`; for p in $$files; do \
echo $$p; \
done
--- NEW FILE: heap.hh ---
/********************************************************************************
utility/heap.hh
purpose:
Heap container class template.
notes:
to do:
author(s):
- Dirk Farin, farin at ti.uni-mannheim.de
modifications:
05/Jan/2000 - Dirk Farin
- first revision
********************************************************************************
Copyright (C) 1999 Dirk Farin
This program is distributed under GNU Public License (GPL) as
outlined in the COPYING file that comes with the source distribution.
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 2 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
********************************************************************************/
#ifndef LIBVIDEOGFX_UTILITY_HEAP_HH
#define LIBVIDEOGFX_UTILITY_HEAP_HH
#include <assert.h>
#include "libvideogfx/types.hh"
class HeapElement
{
public:
virtual ~HeapElement() { }
virtual int AskValue() const = 0;
};
template <class T> class Heap
{
public:
Heap();
~Heap();
void Insert(const T&);
T& AskTop() const { assert(d_entries>0); return d_heap[1]; }
void RemoveTop(); // Remove minimum element.
bool IsEmpty() const { return d_entries==0; }
uint32 Length() const { return d_entries; }
private:
T* d_heap;
int d_size; // Size of heap excluding the first (dummy) element
int d_entries;
void UpHeap(int i);
void DownHeap(int i);
};
#endif
More information about the dslinux-commit
mailing list