Home
last modified time | relevance | path

Searched refs:BeamEntry (Results 1 – 4 of 4) sorted by relevance

/external/tensorflow/tensorflow/lite/experimental/kernels/
Dctc_beam_entry.h59 struct BeamEntry { struct
61 friend BeamEntry<CTCBeamState>* BeamRoot<CTCBeamState>::AddEntry(
62 BeamEntry<CTCBeamState>* p, int l);
66 BeamEntry& GetChild(int ind) { in GetChild() argument
78 const BeamEntry* c = this; in LabelSeq() argument
90 BeamEntry<CTCBeamState>* parent; argument
93 std::unordered_map<int, BeamEntry<CTCBeamState>*> children; argument
104 BeamEntry(BeamEntry* p, int l, BeamRoot<CTCBeamState>* beam_root) in BeamEntry() function
108 BeamEntry(const BeamEntry&) = delete; argument
109 void operator=(const BeamEntry&) = delete; argument
[all …]
Dctc_beam_search.h74 typedef ctc_beam_search::BeamEntry<CTCBeamState> BeamEntry; typedef
148 gtl::TopN<BeamEntry*, CTCBeamComparer> leaves_;
185 std::unique_ptr<std::vector<BeamEntry*>> branches(leaves_.Extract()); in Decode()
188 BeamEntry* entry = (*branches)[i]; in Decode()
277 std::unique_ptr<std::vector<BeamEntry*>> branches(leaves_.Extract()); in Step()
280 for (BeamEntry* b : *branches) { in Step()
285 for (BeamEntry* b : *branches) { in Step()
319 for (BeamEntry* b : *branches) { in Step()
344 BeamEntry& c = b->GetChild(label); in Step()
365 BeamEntry* bottom = leaves_.peek_bottom(); in Step()
[all …]
/external/tensorflow/tensorflow/core/util/ctc/
Dctc_beam_entry.h60 struct BeamEntry { struct
62 friend BeamEntry<CTCBeamState>* BeamRoot<CTCBeamState>::AddEntry(
63 BeamEntry<CTCBeamState>* p, int l);
67 BeamEntry& GetChild(int ind) { in GetChild() argument
79 const BeamEntry* c = this; in LabelSeq() argument
91 BeamEntry<CTCBeamState>* parent; argument
94 gtl::FlatMap<int, BeamEntry<CTCBeamState>*> children; argument
105 BeamEntry(BeamEntry* p, int l, BeamRoot<CTCBeamState>* beam_root) in BeamEntry() argument
108 TF_DISALLOW_COPY_AND_ASSIGN(BeamEntry); argument
116 BeamRoot(BeamEntry<CTCBeamState>* p, int l) { root_entry_ = AddEntry(p, l); } in BeamRoot()
[all …]
Dctc_beam_search.h76 typedef ctc_beam_search::BeamEntry<CTCBeamState> BeamEntry; typedef
150 gtl::TopN<BeamEntry*, CTCBeamComparer> leaves_;
188 std::unique_ptr<std::vector<BeamEntry*>> branches(leaves_.Extract()); in Decode()
191 BeamEntry* entry = (*branches)[i]; in Decode()
280 std::unique_ptr<std::vector<BeamEntry*>> branches(leaves_.Extract()); in Step()
283 for (BeamEntry* b : *branches) { in Step()
288 for (BeamEntry* b : *branches) { in Step()
322 for (BeamEntry* b : *branches) { in Step()
347 BeamEntry& c = b->GetChild(label); in Step()
368 BeamEntry* bottom = leaves_.peek_bottom(); in Step()
[all …]