SkDeque::Iter Class Reference

#include <SkDeque.h>

Inheritance diagram for SkDeque::Iter:

Public Types
enum	IterStart { kFront_IterStart , kBack_IterStart }

Public Member Functions
	Iter ()
	Iter (const SkDeque &d, IterStart startLoc)
void *	next ()
void *	prev ()
void	reset (const SkDeque &d, IterStart startLoc)

Detailed Description

Definition at line 62 of file SkDeque.h.

Member Enumeration Documentation

IterStart

enum SkDeque::Iter::IterStart

Enumerator
kFront_IterStart
kBack_IterStart

Definition at line 64 of file SkDeque.h.

                       {
            kFront_IterStart,
            kBack_IterStart,
        };

Constructor & Destructor Documentation

Iter() [1/2]

SkDeque::Iter::Iter

(

)

Creates an uninitialized iterator. Must be reset()

Definition at line 243 of file SkDeque.cpp.

: fCurBlock(nullptr), fPos(nullptr), fElemSize(0) {}

Iter() [2/2]

SkDeque::Iter::Iter	(	const SkDeque &	d,
		IterStart	startLoc
	)

Definition at line 245 of file SkDeque.cpp.

                                                      {
    this->reset(d, startLoc);
}

Member Function Documentation

next()

void * SkDeque::Iter::next

(

)

Definition at line 251 of file SkDeque.cpp.

                        {
    char* pos = fPos;
 
    if (pos) {   // if we were valid, try to move to the next setting
        char* next = pos + fElemSize;
        SkASSERT(next <= fCurBlock->fEnd);
        if (next == fCurBlock->fEnd) { // exhausted this chunk, move to next
            do {
                fCurBlock = fCurBlock->fNext;
            } while (fCurBlock != nullptr && fCurBlock->fBegin == nullptr);
            next = fCurBlock ? fCurBlock->fBegin : nullptr;
        }
        fPos = next;
    }
    return pos;
}

prev()

void * SkDeque::Iter::prev

(

)

Definition at line 270 of file SkDeque.cpp.

                        {
    char* pos = fPos;
 
    if (pos) {   // if we were valid, try to move to the prior setting
        char* prev = pos - fElemSize;
        SkASSERT(prev >= fCurBlock->fBegin - fElemSize);
        if (prev < fCurBlock->fBegin) { // exhausted this chunk, move to prior
            do {
                fCurBlock = fCurBlock->fPrev;
            } while (fCurBlock != nullptr && fCurBlock->fEnd == nullptr);
            prev = fCurBlock ? fCurBlock->fEnd - fElemSize : nullptr;
        }
        fPos = prev;
    }
    return pos;
}

reset()

void SkDeque::Iter::reset	(	const SkDeque &	d,
		IterStart	startLoc
	)

Definition at line 292 of file SkDeque.cpp.

                                                            {
    fElemSize = d.fElemSize;
 
    if (kFront_IterStart == startLoc) {
        // initialize the iterator to start at the front
        fCurBlock = d.fFrontBlock;
        while (fCurBlock && nullptr == fCurBlock->fBegin) {
            fCurBlock = fCurBlock->fNext;
        }
        fPos = fCurBlock ? fCurBlock->fBegin : nullptr;
    } else {
        // initialize the iterator to start at the back
        fCurBlock = d.fBackBlock;
        while (fCurBlock && nullptr == fCurBlock->fEnd) {
            fCurBlock = fCurBlock->fPrev;
        }
        fPos = fCurBlock ? fCurBlock->fEnd - fElemSize : nullptr;
    }
}

---

The documentation for this class was generated from the following files:

• third_party/skia/include/private/base/SkDeque.h
• third_party/skia/src/base/SkDeque.cpp