OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:kInvalidIndex
(Results
1 - 16
of
16
) sorted by null
/system/update_engine/payload_generator/
graph_types.cc
21
const Vertex::Index Vertex::
kInvalidIndex
= static_cast<Vertex::Index>(-1);
tarjan.cc
31
const vector<Vertex>::size_type
kInvalidIndex
= -1;
41
it->index = it->lowlink =
kInvalidIndex
;
50
CHECK_EQ((*graph)[vertex].index,
kInvalidIndex
);
58
if ((*graph)[vertex_next].index ==
kInvalidIndex
) {
graph_types.h
78
static const Vertex::Index
kInvalidIndex
;
inplace_generator.h
64
Block() : reader(Vertex::
kInvalidIndex
), writer(Vertex::
kInvalidIndex
) {}
159
// If |scratch_vertex| is not
kInvalidIndex
, removes it from
inplace_generator.cc
213
if (blocks[i].reader == Vertex::
kInvalidIndex
||
214
blocks[i].writer == Vertex::
kInvalidIndex
)
645
if (scratch_vertex != Vertex::
kInvalidIndex
) {
689
if ((*blocks)[block].*access_type != Vertex::
kInvalidIndex
) {
710
if (vertex == Vertex::
kInvalidIndex
) {
749
&graph, Vertex::
kInvalidIndex
, &blocks, aop.op, aop.name);
754
Vertex::Index scratch_vertex = Vertex::
kInvalidIndex
;
inplace_generator_unittest.cc
144
// Vertex::
kInvalidIndex
. This is required by the delta generators.
146
EXPECT_EQ(Vertex::
kInvalidIndex
, block.reader);
147
EXPECT_EQ(Vertex::
kInvalidIndex
, block.writer);
488
Vertex::
kInvalidIndex
));
/external/libtextclassifier/smartselect/
types.h
26
constexpr int
kInvalidIndex
= -1;
56
: value(""), start(
kInvalidIndex
), end(
kInvalidIndex
), is_padding(true) {}
feature-processor.cc
227
if (result_begin_codepoint ==
kInvalidIndex
||
228
result_end_codepoint ==
kInvalidIndex
) {
229
*span = CodepointSpan({
kInvalidIndex
,
kInvalidIndex
});
259
if (tokens[i].start !=
kInvalidIndex
&& tokens[i].end > span.first) {
268
if (tokens[i].end !=
kInvalidIndex
&& tokens[i].start < span.second) {
310
TokenIndex start_token =
kInvalidIndex
;
311
TokenIndex end_token =
kInvalidIndex
;
316
if (start_token ==
kInvalidIndex
) {
345
return
kInvalidIndex
;
[
all
...]
text-classification-model.cc
321
if (selection.first ==
kInvalidIndex
|| selection.second ==
kInvalidIndex
) {
406
if (span.first !=
kInvalidIndex
&& span.second !=
kInvalidIndex
&&
429
if (span.first !=
kInvalidIndex
&& span.second !=
kInvalidIndex
) {
/external/v8/src/interpreter/
bytecode-register.h
21
explicit Register(int index =
kInvalidIndex
) : index_(index) {}
25
bool is_valid() const { return index_ !=
kInvalidIndex
; }
92
static const int
kInvalidIndex
= kMaxInt;
/external/brotli/enc/
cluster_inc.h
211
static const uint32_t
kInvalidIndex
= BROTLI_UINT32_MAX;
218
new_index[i] =
kInvalidIndex
;
222
if (new_index[symbols[i]] ==
kInvalidIndex
) {
block_splitter_inc.h
215
static const uint32_t
kInvalidIndex
= BROTLI_UINT32_MAX;
299
for (i = 0; i < num_clusters; ++i) new_index[i] =
kInvalidIndex
;
324
if (new_index[best_out] ==
kInvalidIndex
) {
/external/v8/src/
global-handles.h
425
return singleton_handles_[singleton] !=
kInvalidIndex
;
444
static const int
kInvalidIndex
= -1;
global-handles.cc
[
all
...]
/external/libtextclassifier/tests/
feature-processor_test.cc
292
EXPECT_EQ(token_index,
kInvalidIndex
);
317
EXPECT_EQ(token_index,
kInvalidIndex
);
/art/dexdump/
dexdump.cc
785
static const u4
kInvalidIndex
= std::numeric_limits<u4>::max();
789
u4 secondary_index =
kInvalidIndex
;
[
all
...]
Completed in 318 milliseconds