xfarrow/lasd
1
0
Fork 0
mirror of https://github.com/xfarrow/lasd.git synced 2025-06-05 21:49:14 +02:00
Code Issues Packages Projects Releases Wiki Activity

Library 1

Browse Source 
vector library completed.
list.hpp completed.
This commit is contained in:
Alessandro Ferro
2021-03-31 19:54:40 +02:00
parent 3e73aeb28d
commit 6788a731b3
3 changed files with 116 additions and 56 deletions
Download Patch File Download Diff File Expand all files Collapse all files

57
librerie/exercise1/vector/vector.cpp
View File

@ -121,3 +121,60 @@ void Vector<Data>::Clear(){
Elements = nullptr;
size = 0;
}
template typename<Data>
Data& Vector<Data>::Front() const{
if(size!=0){
return Elements[0];
}else{
return std::length_error("Access to an empty vector");
}
}
template typename<Data>
Data& Vector<Data>::Back() const{
if(size!=0){
return Elements[size-1];
}else{
return std::length_error("Access to an empty vector");
}
}
template typename<Data>
Data& Vector<Data>::operator[](const ulong index) const{
if(index < size){
return Elements[index];
}else{
throw std::out_of_range("Access at index " + std::to_string(index) + " invalid because the vector size is" + std::to_string(size));
}
}
template typename<Data>
void Vector<Data>::MapPreOrder(const MapFunctor fun, void* par){
for(ulong i = 0 ; i<size ; i++){
fun(Elements[i], par);
}
}
template typename<Data>
void Vector<Data>::MapPostOrder(const MapFunctor fun, void* par){
ulong i = size;
while(i>0){
fun(Elements[--i], par);
}
}
template typename<Data>
void Vector<Data>::FoldPreOrder(const FoldFunctor fun, const void* par, void* acc) const{
for(ulong i = 0 ; i<size ; ++i){
fun(Elements[i], par, acc);
}
}
template typename<Data>
void Vector<Data>::FoldPostOrder(const FoldFunctor fun, const void* par, void* acc) const{
ulong i = size;
while(i>0){
fun(Elements[--i], par, acc);
}
}