?? queue.h
字號:
// specification file for an unlimited queue for storing bytes
#ifndef CRYPTOPP_QUEUE_H
#define CRYPTOPP_QUEUE_H
#include "cryptlib.h"
NAMESPACE_BEGIN(CryptoPP)
// The queue is implemented as a linked list of arrays, but you don't need to
// know about that. So just ignore this next line. :)
class ByteQueueNode;
class ByteQueue : public BufferedTransformation
{
public:
ByteQueue(unsigned int nodeSize=256);
ByteQueue(const ByteQueue ©);
~ByteQueue();
// how many bytes currently stored
unsigned long CurrentSize() const;
unsigned long MaxRetrieveable()
{return CurrentSize();}
void Put(byte inByte);
void Put(const byte *inString, unsigned int length);
// both functions returns the number of bytes actually retrived
unsigned int Get(byte &outByte);
unsigned int Get(byte *outString, unsigned int getMax);
unsigned int Peek(byte &outByte) const;
void CopyTo(BufferedTransformation &target) const;
void CopyTo(byte *target) const;
ByteQueue & operator=(const ByteQueue &rhs);
bool operator==(const ByteQueue &rhs) const;
byte operator[](unsigned long i) const;
private:
void CopyFrom(const ByteQueue ©);
void Destroy();
unsigned int nodeSize;
ByteQueueNode *head, *tail;
};
NAMESPACE_END
#endif
?? 快捷鍵說明
復制代碼
Ctrl + C
搜索代碼
Ctrl + F
全屏模式
F11
切換主題
Ctrl + Shift + D
顯示快捷鍵
?
增大字號
Ctrl + =
減小字號
Ctrl + -