HomeSort by relevance Sort by last modified time
    Searched full:shortest (Results 1 - 25 of 91) sorted by null

1 2 3 4

  /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
weight.h 116 // "Semiring Framework and Algorithms for Shortest-Distance Problems",
  /external/icu4c/i18n/unicode/
colldata.h 253 * compute the length of the shortest string that can
340 * Return the length of the shortest string that will generate
346 * @return the length of the shortest string.
354 * Return the length of the shortest string that will generate
368 * @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/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
  /hardware/ti/wlan/wl1271/TWD/MacServices/
MeasurementSrv.h 238 * \brief Finds the index for the measurement request with the shortest period
243 * \return index of the measurement request with the shortest duration.\n
  /system/wlan/ti/sta_dk_4_0_4_32/common/src/TNETW_Driver/MacServices/src/MeasurementSRV/
MeasurementSrv.h 234 * \brief Finds the index for the measurement request with the shortest period
239 * \return index of the measurement request with the shortest duration.\n
  /system/wlan/ti/wilink_6_1/TWD/MacServices/
MeasurementSrv.h 238 * \brief Finds the index for the measurement request with the shortest period
243 * \return index of the measurement request with the shortest duration.\n
  /external/proguard/src/proguard/classfile/instruction/
SimpleInstruction.java 139 // Reconstruct the opcode of the shortest instruction, if there are
  /external/proguard/src/proguard/shrink/
ShortestUsageMarker.java 30 * shortest chain of dependencies.
  /external/webkit/WebCore/storage/
StorageMap.cpp 64 // can take the shortest route.
  /external/icu4c/test/intltest/
usettest.cpp     [all...]
  /external/qemu/distrib/zlib-1.2.3/
inftrees.c 30 longest code or if it is less than the shortest code.
81 for the first code of the shortest length, and the codes are integer
  /external/zlib/contrib/infback9/
inftree9.c 30 longest code or if it is less than the shortest code.
83 for the first code of the shortest length, and the codes are integer
  /external/zlib/
inftrees.c 30 longest code or if it is less than the shortest code.
81 for the first code of the shortest length, and the codes are integer
  /external/gtest/test/
gtest_output_test.py 108 # *? means "find the shortest string that matches".
  /frameworks/base/location/java/android/location/
Location.java 376 * shortest path between them. Distance and bearing are defined using the
428 * North when traveling along the shortest path between this
429 * location and the given location. The shortest path is defined
  /packages/apps/Calendar/res/values/
strings.xml 50 should use the shortest acceptable abbreviation to save space. -->
60 should use the shortest acceptable abbreviation of 'hour' to save space. -->
70 should use the shortest acceptable abbreviation of 'day' to save space. -->

Completed in 1910 milliseconds

1 2 3 4