mirror of
https://github.com/xfarrow/lasd.git
synced 2025-06-05 21:49:14 +02:00
Library 2
This commit is contained in:
@@ -167,7 +167,7 @@ void List<Data>::InsertAtBack(const Data& data){
|
|||||||
template <typename Data>
|
template <typename Data>
|
||||||
void List<Data>::InsertAtBack(Data&& data){
|
void List<Data>::InsertAtBack(Data&& data){
|
||||||
if(size == 0){
|
if(size == 0){
|
||||||
InsertAtFront(data);
|
InsertAtFront(std::move(data));
|
||||||
}
|
}
|
||||||
else{
|
else{
|
||||||
struct Node* last = new Node(std::move(data));
|
struct Node* last = new Node(std::move(data));
|
||||||
|
@@ -37,7 +37,7 @@ QueueVec<Data>::QueueVec(const QueueVec& toCopy){
|
|||||||
|
|
||||||
template <typename Data>
|
template <typename Data>
|
||||||
QueueVec<Data>::QueueVec(QueueVec&& toMove) noexcept{
|
QueueVec<Data>::QueueVec(QueueVec&& toMove) noexcept{
|
||||||
Clear();
|
Clear(); // the moved Queue will be in a consistent state
|
||||||
std::swap(Elements, toMove.Elements);
|
std::swap(Elements, toMove.Elements);
|
||||||
std::swap(rear, toMove.rear);
|
std::swap(rear, toMove.rear);
|
||||||
std::swap(front, toMove.front);
|
std::swap(front, toMove.front);
|
||||||
@@ -140,7 +140,7 @@ bool QueueVec<Data>::Empty() const noexcept{
|
|||||||
|
|
||||||
template <typename Data>
|
template <typename Data>
|
||||||
ulong QueueVec<Data>::Size() const noexcept{
|
ulong QueueVec<Data>::Size() const noexcept{
|
||||||
//if(size == 0) return 0; // this won't ever get executed, it's here just in case
|
//if(size == 0) return 0; // this won't ever get executed, it's here just in case
|
||||||
return ((rear + size) - front) % size;
|
return ((rear + size) - front) % size;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@@ -52,7 +52,7 @@ void StackLst<Data>::Push(const Data& element){
|
|||||||
|
|
||||||
template <typename Data>
|
template <typename Data>
|
||||||
void StackLst<Data>::Push(Data&& element) noexcept{
|
void StackLst<Data>::Push(Data&& element) noexcept{
|
||||||
List<Data>::InsertAtFront(element);
|
List<Data>::InsertAtFront(std::move(element));
|
||||||
}
|
}
|
||||||
|
|
||||||
template <typename Data>
|
template <typename Data>
|
||||||
|
@@ -44,7 +44,7 @@ StackVec<Data>& StackVec<Data>::operator=(const StackVec<Data>& copyFrom){
|
|||||||
template <typename Data>
|
template <typename Data>
|
||||||
StackVec<Data>& StackVec<Data>::operator=(StackVec<Data>&& moveFrom) noexcept{
|
StackVec<Data>& StackVec<Data>::operator=(StackVec<Data>&& moveFrom) noexcept{
|
||||||
Vector<Data>::operator=(std::move(moveFrom));
|
Vector<Data>::operator=(std::move(moveFrom));
|
||||||
stackSize = moveFrom.Size();
|
std::swap(stackSize, moveFrom.stackSize);
|
||||||
return *this;
|
return *this;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
Reference in New Issue
Block a user