OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
full:shortest
(Results
1 - 25
of
250
) sorted by null
1
2
3
4
5
6
7
8
9
10
/external/openfst/src/bin/
fstshortestpath.cc
20
// Find
shortest
path(s) in an FST.
22
#include <fst/script/
shortest
-path.h>
25
DEFINE_int64(nshortest, 1, "Return N-
shortest
paths");
30
"\"fifo\", \"lifo\", \"
shortest
\', \"state\", \"top\"");
39
string usage = "Finds
shortest
path(s) in an FST.\n\n Usage: ";
72
} else if (FLAGS_queue_type == "
shortest
") {
fstshortestdistance.cc
20
// Find
shortest
distances in an FST.
26
#include <fst/script/
shortest
-distance.h>
33
"\"fifo\", \"lifo\", \"
shortest
\", \"state\", \"top\"");
39
string usage = "Finds
shortest
distance(s) in an FST.\n\n Usage: ";
66
} else if (FLAGS_queue_type == "
shortest
") {
fstrmepsilon.cc
31
"\"fifo\", \"lifo\", \"
shortest
\", \"state\", \"top\"");
69
} else if (FLAGS_queue_type == "
shortest
") {
fstprune.cc
20
// Prunes states and arcs of an FST w.r.t. the
shortest
path weight.
/external/srec/tools/thirdparty/OpenFst/fst/lib/
shortest-path.h
0
//
shortest
-path.h
18
// Functions to find
shortest
paths in an FST.
27
#include "fst/lib/
shortest
-distance.h"
37
size_t nshortest; // return n-
shortest
paths
40
//
shortest
distance from the initial state
49
//
Shortest
-path algorithm: normally not called directly; prefer
50
// 'ShortestPath' below with n=1. 'ofst' contains the
shortest
path in
51
// 'ifst'. 'distance' returns the
shortest
distances from the source
55
// The
shortest
path is the lowest weight path w.r.t. the natural
204
// N-
Shortest
-path algorithm: this version allow fine contro
[
all
...]
shortest-distance.h
0
//
shortest
-distance.h
18
// Functions and classes to find
shortest
distance in an FST.
48
// Computation state of the
shortest
-distance algorithm. Reusable
91
// Compute the
shortest
distance. If 'source' is kNoStateId, use
180
//
Shortest
-distance algorithm: this version allows fine control
183
// This computes the
shortest
distance from the 'opts.source' state to
194
//
Shortest
-Distance Problems", Journal of Automata, Languages and
209
//
Shortest
-distance algorithm: simplified interface. See above for a
212
// If 'reverse' is false, this computes the
shortest
distance from the
214
// 'distance' vector. If 'reverse' is true, this computes the
shortest
[
all
...]
prune.h
24
#include "fst/lib/
shortest
-distance.h"
37
// If non-zero, passes in pre-computed
shortest
distance from initial state
40
// If non-zero, passes in pre-computed
shortest
distance to final states
53
// 'opts.threshold' Times() the weight of the
shortest
path. Weights
125
// more than 'opts.threshold' Times() the weight of the
shortest
138
// weight of the
shortest
path. Weights need to be commutative and
235
// 'opts.threshold' Times() the weight of the
shortest
path. Weights
fstlib.h
80
#include "fst/lib/
shortest
-distance.h"
81
#include "fst/lib/
shortest
-path.h"
/external/openfst/src/script/
Makefile.am
11
shortest
-distance.cc
shortest
-path.cc synchronize.cc text-io.cc topsort.cc \
shortest-distance.cc
19
#include <fst/script/
shortest
-distance.h>
shortest-path.cc
19
#include <fst/script/
shortest
-path.h>
/external/openfst/src/include/fst/
shortest-path.h
0
//
shortest
-path.h
19
// Functions to find
shortest
paths in an FST.
33
#include <fst/
shortest
-distance.h>
44
size_t nshortest; // return n-
shortest
paths
47
//
shortest
distance from the initial state
48
bool first_path; // Single
shortest
path stops after finding the first
49
// path to a final state. That path is the
shortest
path
66
//
Shortest
-path algorithm: normally not called directly; prefer
67
// 'ShortestPath' below with n=1. 'ofst' contains the
shortest
path in
68
// 'ifst'. 'distance' returns the
shortest
distances from the sourc
[
all
...]
shortest-distance.h
0
//
shortest
-distance.h
19
// Functions and classes to find
shortest
distance in an FST.
47
// undefined), compute the
shortest
-distances along
49
// by the algorithm. That path is the
shortest
-path
52
// queue discipline is
shortest
-first and all the
63
// Computation state of the
shortest
-distance algorithm. Reusable
113
// Compute the
shortest
distance. If 'source' is kNoStateId, use
223
//
Shortest
-distance algorithm: this version allows fine control
226
// This computes the
shortest
distance from the 'opts.source' state to
239
//
Shortest
-Distance Problems", Journal of Automata, Languages an
[
all
...]
/external/openfst/src/extensions/pdt/
pdtshortestpath.cc
20
// Return the
shortest
path in a (bounded-stack) PDT.
30
DEFINE_bool(path_gc, true, "Garbage collect
shortest
path data");
36
string usage = "
Shortest
path in a (bounded-stack) PDT.\n\n Usage: ";
/external/openfst/src/include/
Makefile.am
23
fst/extensions/pdt/reverse.h fst/extensions/pdt/
shortest
-path.h
40
fst/script/
shortest
-distance.h fst/script/
shortest
-path.h \
61
fst/fst.h fst/properties.h fst/
shortest
-distance.h fst/weight.h \
62
fst/connect.h fst/fstlib.h fst/prune.h fst/
shortest
-path.h \
/external/webrtc/test/testsupport/metrics/
video_metrics.h
52
// This function only compares video frames up to the point when the
shortest
72
// This function only compares video frames up to the point when the
shortest
93
// This function only compares video frames up to the point when the
shortest
/external/strace/
count.c
48
static struct timeval
shortest
= { 1000000, 0 };
variable in typeref:struct:timeval
93
if (tv_cmp(&
shortest
, &one_tick) < 0)
94
*tv =
shortest
;
100
if (tv_cmp(tv, &
shortest
) < 0)
101
shortest
= *tv;
177
tv_mul(&overhead, &
shortest
, 8);
/external/v8/src/
dtoa.h
35
// Return the
shortest
correct representation.
56
// -
SHORTEST
: produce the least amount of digits for which the internal
70
//
shortest
representation of the input.
77
// and a terminating null-character. In
SHORTEST
-mode it expects a buffer of
bignum-dtoa.h
35
// Return the
shortest
correct representation.
54
// -
SHORTEST
: produce the least amount of digits for which the internal
fast-dtoa.h
35
// Computes the
shortest
representation of the given input. The returned
61
// The digits in the buffer are the
shortest
representation possible. E.g.
/frameworks/av/media/libstagefright/codecs/amrwbenc/inc/
wb_vad_c.h
72
#define HANG_LOW 2 /*
shortest
hangover */
74
#define HANG_P2 (Word16)(4*SCALE) /* threshold for
shortest
hangover */
79
#define BURST_LOW 3 /*
shortest
burst length */
81
#define BURST_P2 THR_LOW /* threshold for
shortest
burst */
/external/openfst/src/include/fst/extensions/pdt/
shortest-path.h
0
//
shortest
-path.h
19
// Functions to find
shortest
paths in a PDT.
24
#include <fst/
shortest
-path.h>
50
// Class to store PDT
shortest
path results. Stores
shortest
path
53
// (1) By SearchState: This is a usual node in a
shortest
path tree but:
60
// (2) By ParenSpec: This connects
shortest
path trees depending on the
119
SearchState parent; // Parent state in
shortest
path tree
361
// This computes the single source
shortest
(balanced) path (SSSP)
368
// sub-graph SSSP problem with the
shortest
path up to the ope
[
all
...]
expand.h
29
#include <fst/extensions/pdt/
shortest
-path.h>
326
//
shortest
-stack first queue discipline and relies on the
327
//
shortest
-distance information computed using a reverse
328
//
shortest
-path call to perform the pruning.
388
// 1. states corresponding to
shortest
stack first,
390
// 3. among states with the same stack,
shortest
-first order is used.
479
SP *reverse_shortest_path_; //
Shortest
path for rfst_
494
// the
shortest
-distance from '(s, current_stack_id_)' to the final
544
// Returns the weight of the
shortest
balanced path from 'source' to 'dest'
570
// Returns the
shortest
distance from the initial state to 's' in 'ofst_'
[
all
...]
/external/openfst/
NEWS
56
- issues in internal reuse of
shortest
distance
58
- bug in
shortest
path queue
108
* Unique n-best (see
shortest
-path.h)
/external/icu4c/i18n/unicode/
colldata.h
268
* compute the length of the
shortest
string that can
356
* Return the length of the
shortest
string that will generate
362
* @return the length of the
shortest
string.
370
* Return the length of the
shortest
string that will generate
384
* @return the length of the
shortest
string.
Completed in 1730 milliseconds
1
2
3
4
5
6
7
8
9
10