Skip to content

template.md

Latest commit

 

History

History
303 lines (247 loc) · 8.35 KB

template.md

File metadata and controls

303 lines (247 loc) · 8.35 KB

Template Classes

FixedArr

Definition (FixedArr)

template<typename T,usize _s> using FixedArr = T[_s];

DynamicArr

Definition (DynamicArr)

template<typename T>
class DynamicArr: public NonCopyble;

Type Definition (DynamicArr)

using ContentType = T;

Constructors (DynamicArr)

// default constructor
DynamicArr() noexcept;
// move constructor
DynamicArr(DynamicArr && _other) noexcept;
// construct by c array
DynamicArr(const T* _data,usize _space)noexcept;
// construct by initializer_list
DynamicArr(std::initializer_list<T> const& _ini_list) noexcept;

Operators (DynamicArr)

Move asign (DynamicArr)

DynamicArr& operator=(DynamicArr && _other) noexcept;

T& operator[](usize _pos);
T const& operator[](usize _pos) const;

bool operator==(DynamicArr<T> const& _other) const noexcept

Public functions (DynamicArr)

Clone or change the ownership (DynamicArr)

DynamicArr<T> copy() const noexcept;
virtual DynamicArr<T>&& move() noexcept;

Access to items (DynamicArr)

// access to all
T const* data()const noexcept;
T* data() noexcept;

// iter
DynamicArrIter<T> begin();
DynamicArrIterConst<T> begin()const;
DynamicArrIter<T> end();
DynamicArrIterConst<T> end()const;

Other functions (DynamicArr)

const usize size() const noexcept;

ArrBuffer

Definition (ArrBuffer)

// This class can grow up and reserve size by itself
template<typename T>
class ArrBuffer: public DynamicArr<T>;

Constructors (ArrBuffer)

ArrBuffer()noexcept;
ArrBuffer(const T* _data,usize _space)noexcept;
ArrBuffer(std::initializer_list<T> const& _ini_list) noexcept;
ArrBuffer(ArrBuffer<T> && _other) noexcept;
ArrBuffer(DynamicArr<T>&& _other)noexcept;

Public functions (ArrBuffer)

Size (ArrBuffer)

// Get the size of valid data
const usize size() const noexcept;

// Get the size of space allocated
const usize capability() const noexcept;

// modify the capability
void reserve_by(usize _size) noexcept;
void reserve_to(usize _size);

Access items (ArrBuffer)

Functions extends from DynamicArr also can be used for this class

DynamicArrIter<T> seek(usize _pos) noexcept;

// Just get the view of an item
// then move the iter forward
const T* view_and_move_forward(DynamicArrIter<T>& _iter, usize _size);

Modify items (ArrBuffer)

// push back single
ArrBuffer& push_back(T const& _c) noexcept;

// push back multi
ArrBuffer& push_back(ArrBuffer const& _another) noexcept;

// push back
template<typename _InputType>
requires( std::is_same_v<_InputType,ArrBuffer<T>> ||  std::is_base_of_v<ArrBuffer<byte>,T>) 
ArrBuffer& operator+=(_InputType const& _in_data) noexcept;

// push back a new object
template<typename _InputType>
requires( std::is_same_v<_InputType,ArrBuffer<T>> || std::is_base_of_v<ArrBuffer<byte>,T>)
ArrBuffer operator+(_InputType const& _in_data) noexcept;

// push front single
ArrBuffer& push_front(T const& _c) noexcept;

// push front multi
ArrBuffer& push_front(ArrBuffer const& _another) noexcept;

// tail operation
bool read_from_tail(T* _dist, usize _size) const;
bool erase_from_tail(usize _size) noexcept;

// head operation
bool read_from_head(T* _dist, usize _size) const;
bool erase_from_head(usize _size) noexcept;

// clear or reset
void clear() noexcept;
void zeromem() noexcept;

LinkList

Definition (LinkList)

template<typename Node_t>
requires (__is_node_t<Node_t>)
class LinkList : public NonCopyble;

Type Definition (LinkList)

using T = Node_t::ContentType;
using ContentType = T;

Constructors (LinkList)

LinkList() noexcept;

LinkList(LinkList&& _other)noexcept;

LinkList(std::initializer_list<T> const& _ini_list) noexcept;

Operators (LinkList)

Move assign (LinkList)

LinkList& operator=(LinkList&& _other) noexcept;

Access to items (LinkList)

T& operator[](usize _pos);
T const& operator[](usize _pos) const;

Public functions (LinkList)

Clone or change the ownership (LinkList)

LinkList copy() const noexcept requires(std::is_copy_constructible_v<T>);

virtual LinkList&& move() noexcept;

Access to items (LinkList)

LinkListIter<Node_t> begin() noexcept;
LinkListIterConst<Node_t> begin()const noexcept;

LinkListIter<Node_t> end() noexcept;
LinkListIterConst<Node_t> end()const noexcept;

LinkListIter<Node_t> seek(usize _pos) noexcept;
LinkListIterConst<Node_t> seek(usize _pos) const noexcept;

LinkListIter<Node_t> rbegin() noexcept requires(__is_DoubleNode_t<Node_t>);
LinkListIterConst<Node_t> rbegin() const noexcept requires(__is_DoubleNode_t<Node_t>);


LinkListIter<Node_t> rend() noexcept requires(__is_DoubleNode_t<Node_t>)
LinkListIterConst<Node_t> rend() const noexcept requires(__is_DoubleNode_t<Node_t>);


LinkListIter<Node_t> find(T const& _tar) noexcept requires(__is_eq_comparable<T>)
LinkListIterConst<Node_t> find(T const& _tar) const noexcept requires(__is_eq_comparable<T>)

LinkListIter<Node_t> last() noexcept;
LinkListIterConst<Node_t> last() const noexcept;

Modify items (LinkList)

// Modify the head or tail

// push
template<typename ...Args> void push_back(Args&& ... _data);
template<typename ...Args> void push_front(Args&& ... _data);
// pop
T pop_back();
T pop_front();

// modify any other item

// insert
template<typename ...Args>void insert_back(LinkListIter<Node_t> const& _iter,Args&& ... _data) noexcept;
template<typename ...Args> requires(__is_DoubleNode_t<Node_t>) void insert_front(LinkListIter<Node_t> const& _iter,Args&& ... _data) noexcept;
// erase
template<typename IterType> bool erase(IterType&& _iter) noexcept requires(__is_DoubleNode_t<Node_t>);

Give (LinkList)

Give functions are designed to move a node from one LinkList to another Link list (also supports from self to self)

template<typename IterType_1 , typename IterType_2> void give_to_front(IterType_1&& from_this, IterType_2&& to_other) requires(__is_DoubleNode_t<Node_t>);

template<typename IterType_1 , typename IterType_2> void give_to_back(IterType_1&& from_this, IterType_2&& to_other) requires(__is_DoubleNode_t<Node_t>);

// swap the data of two iters
template<typename IterType_1 , typename IterType_2> static void swap(IterType_1&& _1, IterType_2&& _2)

Other functions (LinkList)

usize size() const noexcept;

SearchBinaryTree

Ordered list

Access to items (SearchBinaryTree)

SearchBinaryTreeIter<T> begin();
SearchBinaryTreeIter<T> end() noexcept;
SearchBinaryTreeConstIter<T> begin() const;
SearchBinaryTreeConstIter<T> end()  const noexcept;
SearchBinaryTreeIter<T> rbegin();
SearchBinaryTreeIter<T> rend() noexcept;
SearchBinaryTreeConstIter<T> rbegin() const;
SearchBinaryTreeConstIter<T> rend()  const noexcept;
const T& min() const noexcept;
const T& max() const noexcept;
void inc_traverse(std::function<void(T&)> const& func);
void inc_traverse(std::function<void(T const&)> const& func) const;
void dec_traverse(std::function<void(T&)> const& func);
void dec_traverse(std::function<void(T const&)> const& func) const;
void root_traverse(std::function<void(T&)> const& func);
void root_traverse(std::function<void(T const&)> const& func) const;