You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
125 lines
1.6 KiB
125 lines
1.6 KiB
/**
|
|
* @file ChunkStack.h
|
|
* Manages a simple stack of chunks
|
|
*
|
|
* @author Ben Gardner
|
|
* @license GPL v2+
|
|
*/
|
|
#ifndef CHUNKSTACK_H_INCLUDED
|
|
#define CHUNKSTACK_H_INCLUDED
|
|
|
|
#include "chunk.h"
|
|
#include "uncrustify_types.h"
|
|
|
|
class ChunkStack
|
|
{
|
|
public:
|
|
struct Entry
|
|
{
|
|
Entry()
|
|
: m_seqnum(0)
|
|
, m_pc(Chunk::NullChunkPtr)
|
|
{
|
|
}
|
|
|
|
|
|
Entry(const Entry &ref)
|
|
: m_seqnum(ref.m_seqnum)
|
|
, m_pc(ref.m_pc)
|
|
{
|
|
}
|
|
|
|
|
|
Entry(size_t sn, Chunk *pc)
|
|
: m_seqnum(sn)
|
|
, m_pc(pc)
|
|
{
|
|
}
|
|
|
|
|
|
size_t m_seqnum;
|
|
Chunk *m_pc;
|
|
};
|
|
|
|
protected:
|
|
std::deque<Entry> m_cse;
|
|
size_t m_seqnum; //! current sequence number
|
|
|
|
public:
|
|
ChunkStack()
|
|
: m_seqnum(0)
|
|
{
|
|
}
|
|
|
|
|
|
ChunkStack(const ChunkStack &cs)
|
|
{
|
|
Set(cs);
|
|
}
|
|
|
|
|
|
virtual ~ChunkStack()
|
|
{
|
|
}
|
|
|
|
|
|
void Set(const ChunkStack &cs);
|
|
|
|
|
|
void Push_Back(Chunk *pc)
|
|
{
|
|
Push_Back(pc, ++m_seqnum);
|
|
}
|
|
|
|
|
|
bool Empty() const
|
|
{
|
|
return(m_cse.empty());
|
|
}
|
|
|
|
|
|
size_t Len() const
|
|
{
|
|
return(m_cse.size());
|
|
}
|
|
|
|
|
|
const Entry *Top() const;
|
|
|
|
|
|
const Entry *Get(size_t idx) const;
|
|
|
|
|
|
Chunk *GetChunk(size_t idx) const;
|
|
|
|
|
|
Chunk *Pop_Back();
|
|
|
|
|
|
void Push_Back(Chunk *pc, size_t seqnum);
|
|
|
|
|
|
Chunk *Pop_Front();
|
|
|
|
|
|
void Reset()
|
|
{
|
|
m_cse.clear();
|
|
}
|
|
|
|
|
|
/**
|
|
* Mark an entry to be removed by Collapse()
|
|
*
|
|
* @param idx The item to remove
|
|
*/
|
|
void Zap(size_t idx);
|
|
|
|
|
|
//! Compresses down the stack by removing dead entries
|
|
void Collapse();
|
|
};
|
|
|
|
|
|
#endif /* CHUNKSTACK_H_INCLUDED */
|