HomeSort by relevance Sort by last modified time
    Searched refs:opts (Results 201 - 225 of 735) sorted by null

1 2 3 4 5 6 7 891011>>

  /external/srec/tools/thirdparty/OpenFst/fst/lib/
shortest-distance.h 63 const ShortestDistanceOptions<Arc, Queue, ArcFilter> &opts,
65 : fst_(fst.Copy()), distance_(distance), state_queue_(opts.state_queue),
66 arc_filter_(opts.arc_filter),
67 delta_(opts.delta), retain_(retain) {
183 // This computes the shortest distance from the 'opts.source' state to
202 const ShortestDistanceOptions<Arc, Queue, ArcFilter> &opts) {
205 sd_state(fst, distance, opts, false);
206 sd_state.ShortestDistance(opts.source);
240 opts(&state_queue, arc_filter);
241 ShortestDistance(fst, distance, opts);
    [all...]
shortest-path.h 52 // state to each state in 'ifst'. 'opts' is used to specify options
64 ShortestPathOptions<Arc, Queue, ArcFilter> &opts) {
80 Queue *state_queue = opts.state_queue;
81 StateId source = opts.source == kNoStateId ? ifst.Start() : opts.source;
87 if (opts.nshortest != 1)
209 // 'ifst'. 'opts' is used to specify options such as the number of
230 ShortestPathOptions<Arc, Queue, ArcFilter> &opts) {
237 size_t n = opts.nshortest;
240 SingleShortestPath(ifst, ofst, distance, opts);
    [all...]
  /external/openfst/src/include/fst/
shortest-path.h 69 // state to each state in 'ifst'. 'opts' is used to specify options
81 ShortestPathOptions<Arc, Queue, ArcFilter> &opts) {
98 Queue *state_queue = opts.state_queue;
99 StateId source = opts.source == kNoStateId ? ifst.Start() : opts.source;
105 if (opts.nshortest != 1) {
111 if (opts.weight_threshold != Weight::Zero() ||
112 opts.state_threshold != kNoStateId) {
152 if (opts.first_path)
392 // 'ifst'. 'opts' is used to specify options such as the number o
    [all...]
shortest-distance.h 80 const ShortestDistanceOptions<Arc, Queue, ArcFilter> &opts,
82 : fst_(fst), distance_(distance), state_queue_(opts.state_queue),
83 arc_filter_(opts.arc_filter), delta_(opts.delta),
84 first_path_(opts.first_path), retain_(retain), source_id_(0),
226 // This computes the shortest distance from the 'opts.source' state to
247 const ShortestDistanceOptions<Arc, Queue, ArcFilter> &opts) {
250 sd_state(fst, distance, opts, false);
251 sd_state.ShortestDistance(opts.source);
292 opts(&state_queue, arc_filter)
    [all...]
determinize.h 337 explicit DeterminizeFstOptions(const CacheOptions &opts,
341 : CacheOptions(opts), delta(del), subsequential_label(lab),
375 const DeterminizeFstOptions<A, D, F, T> &opts)
376 : CacheImpl<A>(opts), fst_(fst.Copy()) {
380 opts.subsequential_label != 0);
474 const DeterminizeFstOptions<A, D, F, T> &opts)
475 : DeterminizeFstImplBase<A>(fst, opts),
476 delta_(opts.delta),
479 filter_(opts.filter ? opts.filter : new F())
812 DeterminizeFstOptions<A, D, F, T> opts; local
    [all...]
const-fst.h 90 static ConstFstImpl<A, U> *Read(istream &strm, const FstReadOptions &opts);
205 const FstReadOptions &opts) {
208 if (!impl->ReadHeader(strm, opts, kMinFileVersion, &hdr)) {
221 LOG(ERROR) << "ConstFst::Read: Alignment failed: " << opts.source;
227 impl->states_region_ = MappedFile::Map(&strm, opts, b);
229 LOG(ERROR) << "ConstFst::Read: Read failed: " << opts.source;
236 LOG(ERROR) << "ConstFst::Read: Alignment failed: " << opts.source;
242 impl->arcs_region_ = MappedFile::Map(&strm, opts, b);
244 LOG(ERROR) << "ConstFst::Read: Read failed: " << opts.source;
282 static ConstFst<A, U> *Read(istream &strm, const FstReadOptions &opts) {
    [all...]
edit-fst.h 95 const FstReadOptions &opts);
97 bool Write(ostream &strm, const FstWriteOptions &opts) const {
99 FstWriteOptions edits_opts(opts);
106 LOG(ERROR) << "EditFstData::Write: write failed: " << opts.source;
337 const FstReadOptions &opts) {
341 FstReadOptions edits_opts(opts);
362 LOG(ERROR) << "EditFst::Read: read failed: " << opts.source;
481 const FstReadOptions &opts);
483 bool Write(ostream &strm, const FstWriteOptions &opts) const {
487 FstWriteOptions header_opts(opts);
    [all...]
rmepsilon.h 79 const RmEpsilonOptions<Arc, Queue> &opts)
80 : fst_(fst), distance_(distance), sd_state_(fst_, distance, opts, true),
230 const RmEpsilonOptions<Arc, Queue> &opts) {
292 rmeps_state(*fst, distance, opts);
321 if (opts.weight_threshold != Weight::Zero() ||
322 opts.state_threshold != kNoStateId)
323 Prune(fst, opts.weight_threshold, opts.state_threshold);
324 if (opts.connect && (opts.weight_threshold == Weight::Zero() |
    [all...]
  /hardware/broadcom/wlan/bcmdhd/dhdutil/
dhdu.c 614 miniopt_t opts; local
618 miniopt_init(&opts, "pktgen", "", FALSE);
620 while ((opt_err = miniopt(&opts, argv)) != -1) {
626 argv += opts.consumed;
628 if (!opts.good_int && opts.opt != 'd') {
629 fprintf(stderr, "invalid integer %s\n", opts.valstr);
634 switch (opts.opt) {
636 pktgen.freq = opts.uval;
639 pktgen.count = opts.uval
955 miniopt_t opts; local
    [all...]
  /external/clang/utils/analyzer/
CmpRuns.py 183 def loadResults(path, opts, root = "", deleteEmpty=True):
184 return loadResultsFromSingleRun(SingleRunInfo(path, root, opts.verboseLog),
256 def dumpScanBuildResultsDiff(dirA, dirB, opts, deleteEmpty=True):
258 resultsA = loadResults(dirA, opts, opts.rootA, deleteEmpty)
259 resultsB = loadResults(dirB, opts, opts.rootB, deleteEmpty)
262 if opts.verboseLog:
263 auxLog = open(opts.verboseLog, "wb")
318 (opts, args) = parser.parse_args(
    [all...]
  /external/chromium_org/chrome_frame/tools/test/page_cycler/
cf_cycler.py 88 (opts, args) = parser.parse_args()
90 urls = LoadSiteList(opts.url_list)
  /external/libsepol/tests/
libsepol-tests.c 85 struct option opts[] = { local
91 while ((i = getopt_long(argc, argv, "vi", opts, NULL)) != -1) {
  /external/openfst/src/bin/
fstcompose.cc 88 fst::ComposeOptions opts(FLAGS_connect, compose_filter);
90 s::Compose(*ifst1, *ifst2, &ofst, opts);
fstdeterminize.cc 58 s::DeterminizeOptions opts(
63 s::Determinize(*ifst, &ofst, opts);
fstdifference.cc 80 fst::DifferenceOptions opts(FLAGS_connect, cf);
82 s::Difference(*ifst1, *ifst2, &ofst, opts);
fstintersect.cc 81 fst::IntersectOptions opts(FLAGS_connect, compose_filter);
83 s::Intersect(*ifst1, *ifst2, &ofst, opts);
fstprune.cc 57 s::PruneOptions opts(weight_threshold, FLAGS_nstate, 0, FLAGS_delta);
59 s::Prune(fst, opts);
  /external/openfst/src/extensions/pdt/
pdtshortestpath.cc 76 s::PdtShortestPathOptions opts(qt, FLAGS_keep_parentheses, FLAGS_path_gc);
77 s::PdtShortestPath(*ifst, parens, &ofst, opts);
  /external/openfst/src/script/
randequivalent.cc 41 const RandGenOptions<RandArcSelection> &opts) {
44 RandEquivalentInnerArgs2 args(fst1, fst2, seed, num_paths, delta, opts);
shortest-distance.cc 26 const ShortestDistanceOptions &opts) {
27 ShortestDistanceArgs1 args(fst, distance, opts);
shortest-path.cc 26 const ShortestPathOptions &opts) {
29 ShortestPathArgs1 args(ifst, ofst, distance, opts);
  /external/qemu/
blockdev.h 29 QemuOpts *opts; member in struct:DriveInfo
48 DriveInfo *add_init_drive(const char *opts);
  /external/robolectric/src/test/java/com/xtremelabs/robolectric/shadows/
BitmapFactoryTest.java 30 BitmapFactory.Options opts = new BitmapFactory.Options(); local
31 Bitmap bitmap = BitmapFactory.decodeResource(Robolectric.application.getResources(), R.drawable.an_image, opts);
35 assertEquals(100, opts.outWidth);
36 assertEquals(100, opts.outHeight);
70 BitmapFactory.Options opts = new BitmapFactory.Options(); local
71 Bitmap bitmap = BitmapFactory.decodeResource(Robolectric.application.getResources(), R.drawable.an_image, opts);
75 assertEquals(123, opts.outWidth);
76 assertEquals(456, opts.outHeight);
  /frameworks/base/native/android/
looper.cpp 32 ALooper* ALooper_prepare(int opts) {
33 return Looper::prepare(opts).get();
  /external/emma/core/java12/com/vladium/emma/instr/
instrCommand.java 67 final IOptsParser.IOpt [] opts = parsedopts.getOpts (); local
69 if (opts == null) // this means there were args parsing errors
79 for (int o = 0; o < opts.length; ++ o)
81 final IOptsParser.IOpt opt = opts [o];
115 "invalid '" + opts [o].getName () + "' option value: " + ov);
127 // process prefixed opts:

Completed in 399 milliseconds

1 2 3 4 5 6 7 891011>>