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
179
) sorted by null
1
2
3
4
5
6
7
8
/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"
push.h
27
#include "fst/lib/
shortest
-distance.h"
queue.h
60
SHORTEST_FIRST_QUEUE = 3, //
Shortest
-first queue
187
//
Shortest
-first queue discipline, templated on the StateId and
263
//
Shortest
-first queue discipline, templated on the StateId and Weight is
503
//
shortest
-first queue using the natural order w.r.t to the distance.
570
": using
shortest
-first discipline";
rmepsilon.h
35
#include "fst/lib/
shortest
-distance.h"
118
//
Shortest
distance algorithm computation state.
198
// The vector 'distance' will be used to hold the
shortest
distances
/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.
fixed-dtoa.h
46
//
shortest
representation of the input.
/frameworks/base/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/icu4c/i18n/unicode/
colldata.h
265
* compute the length of the
shortest
string that can
353
* Return the length of the
shortest
string that will generate
359
* @return the length of the
shortest
string.
367
* Return the length of the
shortest
string that will generate
381
* @return the length of the
shortest
string.
/external/apache-http/src/org/apache/commons/codec/language/
RefinedSoundex.java
79
* same. This return value ranges from 0 to the length of the
shortest
89
* same from 0 to to the length of the
shortest
encoded String.
/external/icu4c/common/
bmpset.h
113
* Bits for 0..7F (non-
shortest
forms) are set to the result of contains(FFFD)
131
* Bits for 0..7FF (non-
shortest
forms) and D800..DFFF are set to
/external/pcre/doc/
pcre_dfa_exec.3
62
PCRE_DFA_SHORTEST Return only the
shortest
match
pcrematching.3
57
algorithm returns the first one that it finds. Whether this is the
shortest
,
88
first match (which is necessarily the
shortest
) is found.
/external/tcpdump/
INSTALL
125
ospf.h - Open
Shortest
Path First definitions
126
ospf6.h - IPv6 Open
Shortest
Path First definitions
190
print-ospf.c - Open
Shortest
Path First printer routines
191
print-ospf6.c - IPv6 Open
Shortest
Path First printer routines
/external/v8/test/cctest/
test-fast-dtoa.cc
13
#include "gay-
shortest
.h"
263
// success rate than for the
shortest
representation.
/packages/apps/Email/src/com/android/email/
SecurityPolicy.java
342
* password will be set to expire in the
shortest
required interval (most secure). This method
345
* based on the requirements of the account with the
shortest
interval.
621
* password will be set to expire in the
shortest
required interval (most secure). The logic
624
* based on the requirements of the account with the
shortest
interval.
641
// the
shortest
-expiring account.
655
* Find the account with the
shortest
expiration time. This is always assumed to be
[
all
...]
/frameworks/base/docs/html/guide/topics/manifest/
supports-screens-element.jd
132
<dd>Specifies the minimum smallestWidth required. The smallestWidth is the
shortest
dimension of
134
the
shortest
of the available screen's two dimensions. So, in order for a device to be considered
141
the smallestWidth because they are the
shortest
dimension of the screen's available space.</p>
/external/chromium/chrome/browser/
process_singleton_win.cc
221
// We should have enough room for the
shortest
command (min_message_size)
222
// and also be a multiple of wchar_t bytes. The
shortest
command
/external/chromium/testing/gtest/test/
gtest_output_test.py
107
# *? means "find the
shortest
string that matches".
115
# *? means "find the
shortest
string that matches".
/external/protobuf/gtest/test/
gtest_output_test.py
108
# *? means "find the
shortest
string that matches".
116
# *? means "find the
shortest
string that matches".
/packages/apps/Email/tests/src/com/android/email/mail/store/imap/
ImapResponseParserTest.java
82
"103 OK\r\n" + //
shortest
OK
83
"* a\r\n" //
shortest
response
Completed in 4863 milliseconds
1
2
3
4
5
6
7
8