Collaboration diagram for QueueEntry:
|The unique key, used for sorting, usually a time stamp [nano sec]. |
|The priority of the queue entry, has higher sorting order than than the time stamp. |
|Mark an entry to be persistent, needed for cache implementations, 'T' is true, 'F' is false. |
|The size of this entry which is given by the client and used to sum up queue->numOfBytes, if 0 we use the size of the blob. |
|A string describing this entry, for example the format of the blob. |
|blob.data is allocated with malloc, you need to free() it yourself, is compressed if marked as such |
Definition at line 47 of file QueueInterface.h.