Method operator[]

src/cryptlib/queue.cpp:253–266

}

byte ByteQueue::operator[](unsigned long i) const
{
    for (ByteQueueNode *current=head; current; current=current->next)
    {
        if (i < current->CurrentSize())
            return (*current)[i];
        
        i -= current->CurrentSize();
    }

    // i should be less than CurrentSize(), therefore we should not be here
    assert(false);
    return 0;
}