OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:kCapacity
(Results
1 - 8
of
8
) sorted by null
/system/chre/util/include/chre/util/
array_queue_impl.h
28
template<typename ElementType, size_t
kCapacity
>
29
ArrayQueue<ElementType,
kCapacity
>::~ArrayQueue() {
35
template<typename ElementType, size_t
kCapacity
>
36
bool ArrayQueue<ElementType,
kCapacity
>::empty() const {
40
template<typename ElementType, size_t
kCapacity
>
41
bool ArrayQueue<ElementType,
kCapacity
>::full() const {
42
return (mSize ==
kCapacity
);
45
template<typename ElementType, size_t
kCapacity
>
46
size_t ArrayQueue<ElementType,
kCapacity
>::size() const {
50
template<typename ElementType, size_t
kCapacity
>
[
all
...]
fixed_size_vector_impl.h
27
template<typename ElementType, size_t
kCapacity
>
28
ElementType *FixedSizeVector<ElementType,
kCapacity
>::data() {
32
template<typename ElementType, size_t
kCapacity
>
33
const ElementType *FixedSizeVector<ElementType,
kCapacity
>::data() const {
37
template<typename ElementType, size_t
kCapacity
>
38
size_t FixedSizeVector<ElementType,
kCapacity
>::size() const {
42
template<typename ElementType, size_t
kCapacity
>
43
size_t FixedSizeVector<ElementType,
kCapacity
>::capacity() const {
44
return
kCapacity
;
47
template<typename ElementType, size_t
kCapacity
>
[
all
...]
array_queue.h
30
template<typename ElementType, size_t
kCapacity
>
168
mPointer = mBase +
kCapacity
;
169
} else if (mPointer == (mBase +
kCapacity
- 1)) {
204
typename ArrayQueue<ElementType,
kCapacity
>::iterator begin();
205
typename ArrayQueue<ElementType,
kCapacity
>::const_iterator begin() const;
206
typename ArrayQueue<ElementType,
kCapacity
>::const_iterator cbegin() const;
211
typename ArrayQueue<ElementType,
kCapacity
>::iterator end();
212
typename ArrayQueue<ElementType,
kCapacity
>::const_iterator end() const;
213
typename ArrayQueue<ElementType,
kCapacity
>::const_iterator cend() const;
221
alignof(ElementType)>::type mData[
kCapacity
];
[
all
...]
fixed_size_vector.h
26
template<typename ElementType, size_t
kCapacity
>
144
* that is greater than
kCapacity
. This will result in an assertion failure
145
* and a resize to
kCapacity
if assertions are disabled. All iterators and
161
typename FixedSizeVector<ElementType,
kCapacity
>::iterator begin();
162
typename FixedSizeVector<ElementType,
kCapacity
>::const_iterator begin() const;
163
typename FixedSizeVector<ElementType,
kCapacity
>::const_iterator cbegin() const;
168
typename FixedSizeVector<ElementType,
kCapacity
>::iterator end();
169
typename FixedSizeVector<ElementType,
kCapacity
>::const_iterator end() const;
170
typename FixedSizeVector<ElementType,
kCapacity
>::const_iterator cend() const;
176
alignof(ElementType)>::type mData[
kCapacity
];
[
all
...]
/external/icu/icu4c/source/tools/toolutil/
denseranges.cpp
30
LargestGaps(int32_t max) : maxLength(max<=
kCapacity
? max :
kCapacity
), length(0) {}
78
static const int32_t
kCapacity
=15;
82
int32_t gapStarts[
kCapacity
];
83
int64_t gapLengths[
kCapacity
];
/external/webrtc/webrtc/modules/rtp_rtcp/source/rtcp_packet/
transport_feedback.cc
107
static const int
kCapacity
= 14;
112
for (size_t i = 0; i <
kCapacity
; ++i) {
124
uint16_t NumSymbols() const override { return
kCapacity
; }
128
vec->insert(vec->end(), &symbols_[0], &symbols_[
kCapacity
]);
163
TransportFeedback::StatusSymbol symbols_[
kCapacity
];
180
static const int
kCapacity
= 7;
185
for (size_t i = 0; i <
kCapacity
; ++i) {
197
uint16_t NumSymbols() const override { return
kCapacity
; }
201
vec->insert(vec->end(), &symbols_[0], &symbols_[
kCapacity
]);
232
TransportFeedback::StatusSymbol symbols_[
kCapacity
];
[
all
...]
/packages/apps/Test/connectivity/sl4n/rapidjson/include/rapidjson/internal/
biginteger.h
133
RAPIDJSON_ASSERT(count_ + offset <=
kCapacity
);
235
RAPIDJSON_ASSERT(count_ <
kCapacity
);
280
static const size_t
kCapacity
= kBitCount / sizeof(Type);
283
Type digits_[
kCapacity
];
/external/v8/src/crankshaft/
hydrogen.cc
[
all
...]
Completed in 647 milliseconds