OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:scc
(Results
1 - 8
of
8
) sorted by null
/frameworks/base/tools/aapt/tests/
CrunchCache_test.cpp
94
CrunchCache
scc
(source2,dest2,sff);
96
scc
.crunch(scu);
/external/openfst/src/include/fst/script/
info-impl.h
135
vector<StateId>
scc
;
local
138
SccVisitor<Arc> scc_visitor(&
scc
, &access, &coaccess, &props);
152
for (StateId s = 0; s <
scc
.size(); ++s) {
159
if (
scc
[s] >= nscc_)
160
nscc_ =
scc
[s] + 1;
/external/openfst/src/include/fst/
rmepsilon.h
277
vector<StateId>
scc
;
local
278
SccVisitor<Arc> scc_visitor(&
scc
, 0, 0, &props);
280
vector<StateId> first(
scc
.size(), kNoStateId);
281
vector<StateId> next(
scc
.size(), kNoStateId);
282
for (StateId i = 0; i <
scc
.size(); i++) {
283
if (first[
scc
[i]] != kNoStateId)
284
next[i] = first[
scc
[i]];
285
first[
scc
[i]] = i;
queue.h
434
//
SCC
topological-order meta-queue discipline, templated on the StateId S
435
// and a queue Q, which is used inside each
SCC
. It visits the
SCC
's
437
// to use within an
SCC
.
444
// Constructor takes a vector specifying the
SCC
number per state
445
// and a vector giving the queue to use per
SCC
number.
446
SccQueue(const vector<StateId> &
scc
, vector<Queue*> *queue)
447
: QueueBase<S>(SCC_QUEUE), queue_(queue), scc_(
scc
), front_(0),
489
if (front_ < back_) // Queue
scc
# back_ not empty unless back_==front_
572
// Find the queue type to use per
SCC
[
all
...]
connect.h
118
// DFS
SCC
algorithm (see Aho, et al, "Design and Analysis of Computer
127
//
scc
[i]: strongly-connected component number for state i.
128
//
SCC
numbers will be in topological order for acyclic input.
134
SccVisitor(vector<StateId> *
scc
, vector<bool> *access,
136
: scc_(
scc
), access_(access), coaccess_(coaccess), props_(props) {}
174
// Numbers
SCC
's in topological order when acyclic.
187
vector<StateId> *scc_; // State's
scc
number
194
StateId nscc_; //
SCC
count
197
vector<StateId> *lowlink_; // lowlink[s] == dfnumber[s] =>
SCC
root
198
vector<bool> *onstack_; // is a state on the
SCC
stac
[
all
...]
/external/srec/tools/thirdparty/OpenFst/fst/lib/
rmepsilon.h
228
vector<StateId>
scc
;
local
229
SccVisitor<Arc> scc_visitor(&
scc
, 0, 0, &props);
231
vector<StateId> first(
scc
.size(), kNoStateId);
232
vector<StateId> next(
scc
.size(), kNoStateId);
233
for (StateId i = 0; i < (StateId)
scc
.size(); i++) {
234
if (first[
scc
[i]] != kNoStateId)
235
next[i] = first[
scc
[i]];
236
first[
scc
[i]] = i;
queue.h
398
//
SCC
topological-order meta-queue discipline, templated on the StateId S
399
// and a queue Q, which is used inside each
SCC
. It visits the
SCC
's
401
// to use within an
SCC
.
408
// Constructor takes a vector specifying the
SCC
number per state
409
// and a vector giving the queue to use per
SCC
number.
410
SccQueue(const vector<StateId> &
scc
, vector<Queue*> *queue)
411
: QueueBase<S>(SCC_QUEUE), queue_(queue), scc_(
scc
), front_(0),
457
if (front_ < back_) // Queue
scc
# back_ not empty unless back_==front_
535
// Find the queue type to use per
SCC
[
all
...]
connect.h
28
// DFS
SCC
algorithm (see Aho, et al, "Design and Analysis of Computer
37
//
scc
[i]: strongly-connected component number for state i.
38
//
SCC
numbers will be in topological order for acyclic input.
44
SccVisitor(vector<StateId> *
scc
, vector<bool> *access,
46
: scc_(
scc
), access_(access), coaccess_(coaccess), props_(props) {}
132
if ((*dfnumber_)[s] == (*lowlink_)[s]) { // root of new
SCC
165
// Numbers
SCC
's in topological order when acyclic.
178
vector<StateId> *scc_; // State's
scc
number
185
StateId nscc_; //
SCC
count
188
vector<StateId> *lowlink_; // lowlink[s] == dfnumber[s] =>
SCC
roo
[
all
...]
Completed in 253 milliseconds