OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:arc1
(Results
1 - 7
of
7
) sorted by null
/external/openfst/src/include/fst/
equal.h
73
Arc
arc1
= aiter1.Value();
local
75
if (
arc1
.ilabel != arc2.ilabel) {
79
<< ", ilabel1 = " <<
arc1
.ilabel
82
} else if (
arc1
.olabel != arc2.olabel) {
86
<< ", olabel1 = " <<
arc1
.olabel
89
} else if (!ApproxEqual(
arc1
.weight, arc2.weight, delta)) {
93
<< ", weight1 = " <<
arc1
.weight
96
} else if (
arc1
.nextstate != arc2.nextstate) {
100
<< ", nextstate1 = " <<
arc1
.nextstate
compose-filter.h
186
// FilterState FilterArc(Arc *
arc1
, Arc *arc2) const;
258
FilterState FilterArc(Arc *
arc1
, Arc *arc2) const {
259
if (
arc1
->olabel == kNoLabel)
265
return
arc1
->olabel == 0 ? FilterState::NoState() : FilterState(0);
343
FilterState FilterArc(Arc *
arc1
, Arc *arc2) const {
347
else if (
arc1
->olabel == kNoLabel)
350
return
arc1
->olabel == 0 ? FilterState::NoState() : FilterState(0);
436
FilterState FilterArc(Arc *
arc1
, Arc *arc2) const {
442
else if (
arc1
->olabel == kNoLabel) // Epsilon on Fst2
447
else if (
arc1
->olabel == 0) // Epsilon on bot
[
all
...]
arcsort.h
179
bool operator() (A
arc1
, A arc2) const {
180
return
arc1
.ilabel < arc2.ilabel;
193
bool operator() (const A &
arc1
, const A &arc2) const {
194
return
arc1
.olabel < arc2.olabel;
lookahead-filter.h
184
// This filter uses a lookahead matcher in FilterArc(
arc1
, arc2) to
185
// examine the future of the composition state (
arc1
.nextstate,
248
FilterState FilterArc(Arc *
arc1
, Arc *arc2) const {
251
const FilterState &f = filter_.FilterArc(
arc1
, arc2);
255
return LookAheadOutput() ? LookAheadFilterArc(
arc1
, arc2, f) :
256
LookAheadFilterArc(arc2,
arc1
, f);
365
FilterState FilterArc(Arc *
arc1
, Arc *arc2) const {
366
const FilterState1 &f1 = filter_.FilterArc(
arc1
, arc2);
494
FilterState FilterArc(Arc *
arc1
, Arc *arc2) const {
496
return FilterState(filter_.FilterArc(
arc1
, arc2)
[
all
...]
minimize.h
89
const A&
arc1
= aiter1.Value();
local
91
if (
arc1
.ilabel < arc2.ilabel) return true;
92
if (
arc1
.ilabel > arc2.ilabel) return false;
94
if (partition_.class_id(
arc1
.nextstate) <
96
if (partition_.class_id(
arc1
.nextstate) >
compose.h
331
void AddArc(StateId s, const Arc &
arc1
, const Arc &arc2,
333
StateTuple tuple(
arc1
.nextstate, arc2.nextstate, f);
334
Arc oarc(
arc1
.ilabel, arc2.olabel, Times(
arc1
.weight, arc2.weight),
/external/openfst/src/include/fst/extensions/pdt/
compose.h
352
FilterState FilterArc(Arc *
arc1
, Arc *arc2) const {
353
FilterState1 f1 = filter_.FilterArc(
arc1
, arc2);
358
if (
arc1
->olabel == kNoLabel && arc2->ilabel) { // arc2 parentheses
360
arc1
->ilabel = arc2->ilabel;
362
arc2->olabel =
arc1
->ilabel;
365
} else if (arc2->ilabel == kNoLabel &&
arc1
->olabel) { //
arc1
parentheses
367
arc2->olabel =
arc1
->olabel;
369
arc1
->ilabel = arc2->olabel;
371
return FilterParen(
arc1
->olabel, f1, f2)
[
all
...]
Completed in 568 milliseconds