hyung-hwan/qse
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

added some convenience functions to QSE::LinkedList, QSE::HashTable, and QSE::HashList

Browse Source
This commit is contained in:
hyung-hwan
2017-09-04 12:32:48 +00:00
parent 3cd745c181
commit 8b40ed630c
8 changed files with 85 additions and 98 deletions
Download Patch File Download Diff File Expand all files Collapse all files

27
qse/include/qse/cmn/HashList.hpp
View File

@ -300,26 +300,15 @@ public:
return this->datum_list->isEmpty ();
}
Node* getHeadNode ()
{
return this->datum_list->getHeadNode ();
}
const Node* getHeadNode () const
{
return this->datum_list->getHeadNode ();
}
Node* getTailNode ()
{
return this->datum_list->getTailNode ();
}
const Node* getTailNode () const
{
return this->datum_list->getTailNode ();
}
Node* getHeadNode () { return this->datum_list->getHeadNode (); }
const Node* getHeadNode () const { return this->datum_list->getHeadNode (); }
Node* getFirstNode () { return this->datum_list->getHeadNode (); }
const Node* getFirstNode () const { return this->datum_list->getHeadNode (); }
Node* getTailNode () { return this->datum_list->getTailNode (); }
const Node* getTailNode () const { return this->datum_list->getTailNode (); }
Node* getLastNode () { return this->datum_list->getTailNode (); }
const Node* getLastNode () const { return this->datum_list->getTailNode (); }
protected:
Node* find_node (const T& datum) const
{

26
qse/include/qse/cmn/HashTable.hpp
View File

@ -174,25 +174,15 @@ public:
return this->pair_list.isEmpty ();
}
PairNode* getHeadNode ()
{
return this->pair_list.getHeadNode ();
}
PairNode* getHeadNode () { return this->pair_list.getHeadNode (); }
const PairNode* getHeadNode () const { return this->pair_list.getHeadNode (); }
PairNode* getFirstNode () { return this->pair_list.getHeadNode (); }
const PairNode* getFirstNode () const { return this->pair_list.getHeadNode (); }
const PairNode* getHeadNode () const
{
return this->pair_list.getHeadNode ();
}
PairNode* getTailNode ()
{
return this->pair_list.getTailNode ();
}
const PairNode* getTailNode () const
{
return this->pair_list.getTailNode ();
}
PairNode* getTailNode () { return this->pair_list.getTailNode (); }
const PairNode* getTailNode () const { return this->pair_list.getTailNode (); }
PairNode* getLastNode () { return this->pair_list.getTailNode (); }
const PairNode* getLastNode () const { return this->pair_list.getTailNode (); }
Pair* inject (const K& key, const V& value, int mode, bool* injected = QSE_NULL)
{

60
qse/include/qse/cmn/LinkedList.hpp
View File

@ -325,17 +325,13 @@ public:
/// The prependNode() function adds an externally created \a node
/// to the front of the list.
Node* prependNode (Node* node)
{
return this->insertNode (this->head_node, node);
}
Node* prependNode (Node* node) { return this->insertNode (this->head_node, node); }
Node* insertFirstNode (Node* node) { return this->insertNode (this->head_node, node); }
/// The appendNode() function adds an externally created \a node
/// to the back of the list.
Node* appendNode (Node* node)
{
return this->insertNode (QSE_NULL, node);
}
Node* appendNode (Node* node) { return this->insertNode (QSE_NULL, node); }
Node* insertLastNode (Node* node) { return this->insertNode (QSE_NULL, node); }
// create a new node to hold the value and insert it.
Node* insert (Node* pos, const T& value)
@ -344,15 +340,11 @@ public:
return this->insertNode (pos, node);
}
Node* prepend (const T& value)
{
return this->insert (this->head_node, value);
}
Node* prepend (const T& value) { return this->insert (this->head_node, value); }
Node* insertFirst (const T& value) { return this->insert (this->head_node, value); }
Node* append (const T& value)
{
return this->insert ((Node*)QSE_NULL, value);
}
Node* append (const T& value) { return this->insert ((Node*)QSE_NULL, value); }
Node* insertLast (const T& value) { return this->insert ((Node*)QSE_NULL, value); }
void prependAll (const SelfType& list)
{
@ -475,15 +467,11 @@ public:
return cnt;
}
void removeHead ()
{
this->remove (this->head_node);
}
void removeHead () { this->remove (this->head_node); }
void removeFirst () { this->remove (this->head_node); }
void removeTail ()
{
this->remove (this->tail_node);
}
void removeTail () { this->remove (this->tail_node); }
void removeLast () { this->remove (this->tail_node); }
/// The getHeadNode() function returns the first node.
/// \code
@ -494,15 +482,11 @@ public:
/// printf ("%d\n", np->value);
/// }
/// \endcode
Node* getHeadNode ()
{
return this->head_node;
}
Node* getHeadNode () { return this->head_node; }
const Node* getHeadNode () const { return this->head_node; }
const Node* getHeadNode () const
{
return this->head_node;
}
Node* getFirstNode () { return this->head_node; }
const Node* getFirstNode () const { return this->head_node; }
/// The getTailNode() function returns the last node.
/// \code
@ -513,15 +497,11 @@ public:
/// printf ("%d\n", np->value);
/// }
/// \endcode
Node* getTailNode ()
{
return this->tail_node;
}
Node* getTailNode () { return this->tail_node; }
const Node* getTailNode () const { return this->tail_node; }
const Node* getTailNode () const
{
return this->tail_node;
}
Node* getLastNode () { return this->tail_node; }
const Node* getLastNode () const { return this->tail_node; }
protected:
Node* get_node_at (qse_size_t index) const