xfarrow
/
lasd
mirror of https://github.com/xfarrow/lasd.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

Update

This commit is contained in:
Alessandro Ferro 2021-07-06 00:00:36 +02:00
parent 8f7716bc2d
commit a6485b86af
8 changed files with 44 additions and 44 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

12
librerie/exercise2/queue/vec/queuevec.cpp
View File

@ -1,9 +1,9 @@
#define MINSIZE 4
namespace lasd {
template <typename Data>
QueueVec<Data>::QueueVec(){
size = 4;
size = MINSIZE;
rear = 0;
front = 0;
Elements = new Data[size];
@ -146,10 +146,10 @@ ulong QueueVec<Data>::Size() const noexcept{
template <typename Data>
void QueueVec<Data>::Clear(){
if(size!=4){
if(size!=MINSIZE){
delete[] Elements;
Elements = new Data[4];
size = 4;
Elements = new Data[MINSIZE];
size = MINSIZE;
}
front = 0;
rear = 0;
@ -173,7 +173,7 @@ void QueueVec<Data>::Expand(){
template <typename Data>
void QueueVec<Data>::Reduce(){
if(size<=4) return; // we are not going to have vectors with less than 4 Elements
if(size<(MINSIZE*2)) return; // we are not going to have vectors with less than 4 Elements
ulong newsize = (ulong)size/2;
Data* tmp = new Data[newsize];
ulong current_index = front , i=0;

10
librerie/exercise2/stack/vec/stackvec.cpp
View File

@ -1,11 +1,11 @@
#define MINSIZE 4
namespace lasd {
/* ************************************************************************** */
// constructors
template <typename Data>
StackVec<Data>::StackVec(){
size = 4; // default vector is instantiated with 4 cells
size = MINSIZE; // default vector is instantiated with 4 cells
stackSize = 0;
Elements = new Data[size];
}
@ -129,15 +129,15 @@ void StackVec<Data>::Expand(){
template <typename Data>
void StackVec<Data>::Reduce(){
if(size <= 4) return; // we're not going to have vectors with less than 4 cells
if(size < (MINSIZE*2)) return; // we're not going to have vectors with less than 4 cells
Vector<Data>::Resize((ulong)size/2);
}
template <typename Data>
void StackVec<Data>::Clear(){
delete [] Elements;
size = 4;
size = MINSIZE;
stackSize = 0;
Elements = new Data[size];
Elements = new Data[MINSIZE];
}
}

12
librerie/exercise3/queue/vec/queuevec.cpp
View File

@ -1,9 +1,9 @@
#define MINSIZE 4
namespace lasd {
template <typename Data>
QueueVec<Data>::QueueVec(){
size = 4;
size = MINSIZE;
rear = 0;
front = 0;
Elements = new Data[size];
@ -146,10 +146,10 @@ ulong QueueVec<Data>::Size() const noexcept{
template <typename Data>
void QueueVec<Data>::Clear(){
if(size!=4){
if(size!=MINSIZE){
delete[] Elements;
Elements = new Data[4];
size = 4;
Elements = new Data[MINSIZE];
size = MINSIZE;
}
front = 0;
rear = 0;
@ -173,7 +173,7 @@ void QueueVec<Data>::Expand(){
template <typename Data>
void QueueVec<Data>::Reduce(){
if(size<=4) return; // we are not going to have vectors with less than 4 Elements
if(size<(MINSIZE*2)) return; // we are not going to have vectors with less than 4 Elements
ulong newsize = (ulong)size/2;
Data* tmp = new Data[newsize];
ulong current_index = front , i=0;

10
librerie/exercise3/stack/vec/stackvec.cpp
View File

@ -1,11 +1,11 @@
#define MINSIZE 4
namespace lasd {
/* ************************************************************************** */
// constructors
template <typename Data>
StackVec<Data>::StackVec(){
size = 4; // default vector is instantiated with 4 cells
size = MINSIZE; // default vector is instantiated with 4 cells
stackSize = 0;
Elements = new Data[size];
}
@ -129,15 +129,15 @@ void StackVec<Data>::Expand(){
template <typename Data>
void StackVec<Data>::Reduce(){
if(size <= 4) return; // we're not going to have vectors with less than 4 cells
if(size < (MINSIZE*2)) return; // we're not going to have vectors with less than 4 cells
Vector<Data>::Resize((ulong)size/2);
}
template <typename Data>
void StackVec<Data>::Clear(){
delete [] Elements;
size = 4;
size = MINSIZE;
stackSize = 0;
Elements = new Data[size];
Elements = new Data[MINSIZE];
}
}

12
librerie/exercise4/queue/vec/queuevec.cpp
View File

@ -1,9 +1,9 @@
#define MINSIZE 4
namespace lasd {
template <typename Data>
QueueVec<Data>::QueueVec(){
size = 4;
size = MINSIZE;
rear = 0;
front = 0;
Elements = new Data[size];
@ -146,10 +146,10 @@ ulong QueueVec<Data>::Size() const noexcept{
template <typename Data>
void QueueVec<Data>::Clear(){
if(size!=4){
if(size!=MINSIZE){
delete[] Elements;
Elements = new Data[4];
size = 4;
Elements = new Data[MINSIZE];
size = MINSIZE;
}
front = 0;
rear = 0;
@ -173,7 +173,7 @@ void QueueVec<Data>::Expand(){
template <typename Data>
void QueueVec<Data>::Reduce(){
if(size<=4) return; // we are not going to have vectors with less than 4 Elements
if(size<(MINSIZE*2)) return; // we are not going to have vectors with less than 4 Elements
ulong newsize = (ulong)size/2;
Data* tmp = new Data[newsize];
ulong current_index = front , i=0;

10
librerie/exercise4/stack/vec/stackvec.cpp
View File

@ -1,11 +1,11 @@
#define MINSIZE 4
namespace lasd {
/* ************************************************************************** */
// constructors
template <typename Data>
StackVec<Data>::StackVec(){
size = 4; // default vector is instantiated with 4 cells
size = MINSIZE; // default vector is instantiated with 4 cells
stackSize = 0;
Elements = new Data[size];
}
@ -129,15 +129,15 @@ void StackVec<Data>::Expand(){
template <typename Data>
void StackVec<Data>::Reduce(){
if(size <= 4) return; // we're not going to have vectors with less than 4 cells
if(size < (MINSIZE*2)) return; // we're not going to have vectors with less than 4 cells
Vector<Data>::Resize((ulong)size/2);
}
template <typename Data>
void StackVec<Data>::Clear(){
delete [] Elements;
size = 4;
size = MINSIZE;
stackSize = 0;
Elements = new Data[size];
Elements = new Data[MINSIZE];
}
}

12
librerie/exercise5/queue/vec/queuevec.cpp
View File

@ -1,9 +1,9 @@
#define MINSIZE 4
namespace lasd {
template <typename Data>
QueueVec<Data>::QueueVec(){
size = 4;
size = MINSIZE;
rear = 0;
front = 0;
Elements = new Data[size];
@ -146,10 +146,10 @@ ulong QueueVec<Data>::Size() const noexcept{
template <typename Data>
void QueueVec<Data>::Clear(){
if(size!=4){
if(size!=MINSIZE){
delete[] Elements;
Elements = new Data[4];
size = 4;
Elements = new Data[MINSIZE];
size = MINSIZE;
}
front = 0;
rear = 0;
@ -173,7 +173,7 @@ void QueueVec<Data>::Expand(){
template <typename Data>
void QueueVec<Data>::Reduce(){
if(size<=4) return; // we are not going to have vectors with less than 4 Elements
if(size<(MINSIZE*2)) return; // we are not going to have vectors with less than 4 Elements
ulong newsize = (ulong)size/2;
Data* tmp = new Data[newsize];
ulong current_index = front , i=0;

10
librerie/exercise5/stack/vec/stackvec.cpp
View File

@ -1,11 +1,11 @@
#define MINSIZE 4
namespace lasd {
/* ************************************************************************** */
// constructors
template <typename Data>
StackVec<Data>::StackVec(){
size = 4; // default vector is instantiated with 4 cells
size = MINSIZE; // default vector is instantiated with 4 cells
stackSize = 0;
Elements = new Data[size];
}
@ -129,15 +129,15 @@ void StackVec<Data>::Expand(){
template <typename Data>
void StackVec<Data>::Reduce(){
if(size <= 4) return; // we're not going to have vectors with less than 4 cells
if(size < (MINSIZE*2)) return; // we're not going to have vectors with less than 4 cells
Vector<Data>::Resize((ulong)size/2);
}
template <typename Data>
void StackVec<Data>::Clear(){
delete [] Elements;
size = 4;
size = MINSIZE;
stackSize = 0;
Elements = new Data[size];
Elements = new Data[MINSIZE];
}
}