First pass linklist

This commit is contained in:
Cuyler36
2023-11-28 11:17:10 -05:00
parent b61bf26bdb
commit fa466b571b
4 changed files with 425 additions and 0 deletions
+170
View File
@@ -0,0 +1,170 @@
#ifndef JGADGET_LINK_H
#define JGADGET_LINK_H
#include "types.h"
#include "JSystem/JUtility/JUTAssertion.h"
namespace JGadget {
#define JGADGET_ASSERTWARN(cond) \
if ((cond) == false) \
{ \
/*JGadget_outMessage msg(&warning);*/ \
/*msg << (#cond);*/ \
}
#define JGADGET_EXIT(cond) \
if ((cond) == false) \
{ \
/*JGadget_outMessage msg(&warning);*/ \
/*msg << (#cond);*/ \
return false; \
}
/* TODO: this definitely has a better place to live */
template <typename T>
class TPRIsEqual_pointer_ {
public:
TPRIsEqual_pointer_<T>(const T* p) { this->p_ = p; }
bool operator()(const T& rSrc) const {
return this->p_ == &rSrc;
}
private:
const T* p_;
};
class TLinkListNode {
public:
TLinkListNode() {
this->pNext_ = nullptr;
this->pPrev_ = nullptr;
}
~TLinkListNode() {
JGADGET_ASSERTWARN(pNext_==NULL);
JGADGET_ASSERTWARN(pPrev_==NULL);
}
TLinkListNode* getNext() const {
return this->pNext_;
}
TLinkListNode* getPrev() const {
return this->pPrev_;
}
void clear_() {
this->pNext_ = nullptr;
this->pPrev_ = nullptr;
}
TLinkListNode* pNext_;
TLinkListNode* pPrev_;
};
class TNodeLinkList {
public:
TNodeLinkList() { Initialize_(); }
~TNodeLinkList();
class iterator {
public:
iterator() { this->p_ = nullptr; }
iterator(TLinkListNode* node) { this->p_ = node; }
iterator(const iterator& it) { this->p_ = it.p_; }
iterator& operator++() {
this->p_ = this->p_->getNext();
return *this;
}
iterator& operator--() {
this->p_ = this->p_->getPrev();
return *this;
}
TLinkListNode& operator*() const {
JUT_ASSERT(p_!=0);
return *this->p_;
}
TLinkListNode* operator->() const { return this->p_; }
TLinkListNode* p_;
};
class const_iterator {
public:
const_iterator(const TLinkListNode* node) { this->p_ = node; }
const_iterator(iterator it) { this->p_ = it.p_; }
const_iterator(const const_iterator& it) { this->p_ = it.p_; }
const const_iterator& operator++() {
this->p_ = this->p_->getNext();
return *this;
}
const const_iterator& operator--() {
this->p_ = this->p_->getPrev();
return *this;
}
const TLinkListNode* operator->() const { return this->p_; }
const TLinkListNode* p_;
};
bool Confirm() const;
bool Confirm_iterator(const_iterator it) const;
iterator Erase(TLinkListNode* node);
iterator Find(const TLinkListNode* node);
iterator Insert(iterator it, TLinkListNode* node);
void Remove(TLinkListNode* node);
template <typename Predicate> void Remove_if(Predicate predicate, TNodeLinkList& tList);
s32 size() const { return this->size_; }
bool empty() const { return this->size() == 0; }
void clear() { this->erase(this->begin(), this->end()); }
iterator erase(iterator itStart, iterator itEnd);
iterator erase(iterator it);
template <typename Predicate> void remove_if(Predicate predicate) {
TNodeLinkList list;
this->Remove_if(predicate, list);
}
void splice(iterator it, TNodeLinkList& rSrc, iterator itBegin, iterator itEnd);
void splice(iterator it, TNodeLinkList& rSrc);
void splice(iterator it, TNodeLinkList& rSrc, iterator otherIt);
iterator pop_back() { return this->erase(--this->end()); }
iterator pop_font() { return this->erase(++this->begin()); }
iterator begin() { return this->oNode_.getNext(); }
const_iterator begin() const { return this->oNode_.getNext(); }
iterator end() { return &this->oNode_; }
const_iterator end() const { return &this->oNode_; }
private:
void Initialize_() {
this->size_ = 0;
this->oNode_.pNext_ = &this->oNode_;
this->oNode_.pPrev_ = &this->oNode_;
}
bool Iterator_isEnd_(const_iterator it) const { return &this->oNode_ == it.p_; }
s32 size_;
TLinkListNode oNode_;
};
bool operator==(TNodeLinkList::iterator lhs, TNodeLinkList::iterator rhs) { return lhs.p_ == rhs.p_; }
bool operator!=(TNodeLinkList::iterator lhs, TNodeLinkList::iterator rhs) { return !(lhs == rhs); }
bool operator==(TNodeLinkList::const_iterator lhs, TNodeLinkList::const_iterator rhs) { return lhs.p_ == rhs.p_; }
bool operator!=(TNodeLinkList::const_iterator lhs, TNodeLinkList::const_iterator rhs) { return !(lhs == rhs); }
}
#endif
+19
View File
@@ -0,0 +1,19 @@
#ifndef ALGORITHM_H
#define ALGORITHM_H
#include "types.h"
namespace std {
template <class InputIterator, class Predicate>
inline
InputIterator
find_if(InputIterator first, InputIterator last, Predicate pred) {
while (first != last && !pred(*first))
++first;
return first;
}
} // namespace std
#endif
+38
View File
@@ -0,0 +1,38 @@
#ifndef ITERATOR_H
#define ITERATOR_H
#include "types.h"
namespace std {
struct input_iterator_tag {};
template<class Iterator>
struct iterator_traits {
typedef typename Iterator::difference_type difference_type;
typedef typename Iterator::value_type value_type;
typedef typename Iterator::pointer pointer;
typedef typename Iterator::reference reference;
typedef typename Iterator::iterator_category iterator_category;
};
template <class InputIterator>
inline
typename iterator_traits<InputIterator>::difference_type
__distance(InputIterator first, InputIterator last, input_iterator_tag) {
typename iterator_traits<InputIterator>::difference_type result = 0;
for (; first != last; ++first)
++result;
return result;
}
template <class InputIterator>
inline
typename iterator_traits<InputIterator>::difference_type
distance(InputIterator first, InputIterator last) {
return __distance(first, last, typename iterator_traits<InputIterator>::iterator_category());
}
} // namespace std
#endif