blob: 321c138357e6a3108fba8d9fefb9d80d9ecad185 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
|
/*
* Copyright (C) 2006 The Android Open Source Project
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#ifndef SkTDStack_DEFINED
#define SkTDStack_DEFINED
#include "SkTypes.h"
template <typename T> class SkTDStack : SkNoncopyable {
public:
SkTDStack() : fCount(0), fTotalCount(0)
{
fInitialRec.fNext = NULL;
fRec = &fInitialRec;
// fCount = kSlotCount;
}
~SkTDStack()
{
Rec* rec = fRec;
while (rec != &fInitialRec)
{
Rec* next = rec->fNext;
sk_free(rec);
rec = next;
}
}
int count() const { return fTotalCount; }
int depth() const { return fTotalCount; }
bool empty() const { return fTotalCount == 0; }
T* push()
{
SkASSERT(fCount <= kSlotCount);
if (fCount == kSlotCount)
{
Rec* rec = (Rec*)sk_malloc_throw(sizeof(Rec));
rec->fNext = fRec;
fRec = rec;
fCount = 0;
}
++fTotalCount;
return &fRec->fSlots[fCount++];
}
void push(const T& elem) { *this->push() = elem; }
const T& index(int idx) const
{
SkASSERT(fRec && fCount > idx);
return fRec->fSlots[fCount - idx - 1];
}
T& index(int idx)
{
SkASSERT(fRec && fCount > idx);
return fRec->fSlots[fCount - idx - 1];
}
const T& top() const
{
SkASSERT(fRec && fCount > 0);
return fRec->fSlots[fCount - 1];
}
T& top()
{
SkASSERT(fRec && fCount > 0);
return fRec->fSlots[fCount - 1];
}
void pop(T* elem)
{
if (elem)
*elem = fRec->fSlots[fCount - 1];
this->pop();
}
void pop()
{
SkASSERT(fCount > 0 && fRec);
--fTotalCount;
if (--fCount == 0)
{
if (fRec != &fInitialRec)
{
Rec* rec = fRec->fNext;
sk_free(fRec);
fCount = kSlotCount;
fRec = rec;
}
else
SkASSERT(fTotalCount == 0);
}
}
private:
enum {
kSlotCount = 8
};
struct Rec;
friend struct Rec;
struct Rec {
Rec* fNext;
T fSlots[kSlotCount];
};
Rec fInitialRec;
Rec* fRec;
int fCount, fTotalCount;
};
#endif
|
