/usr/include/fst/vector-fst.h is in libfst-dev 1.5.3+r3-2.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 | // See www.openfst.org for extensive documentation on this weighted
// finite-state transducer library.
//
// Simple concrete, mutable FST whose states and arcs are stored in STL vectors.
#ifndef FST_LIB_VECTOR_FST_H_
#define FST_LIB_VECTOR_FST_H_
#include <string>
#include <vector>
#include <fst/fst-decl.h> // For optional argument declarations
#include <fst/mutable-fst.h>
#include <fst/test-properties.h>
namespace fst {
template <class A, class S>
class VectorFst;
template <class F, class G>
void Cast(const F &, G *);
// Arcs (of type A) implemented by an STL vector per state. M specifies Arc
// allocator (default declared in fst-decl.h).
template <class A, class M /* = std::allocator<A> */>
class VectorState {
public:
typedef A Arc;
typedef typename A::Weight Weight;
typedef typename A::StateId StateId;
typedef M ArcAllocator;
typedef typename ArcAllocator::template rebind<VectorState<A, M>>::other
StateAllocator;
// Provide STL allocator for arcs
explicit VectorState(const ArcAllocator &alloc)
: final_(Weight::Zero()), niepsilons_(0), noepsilons_(0), arcs_(alloc) {}
VectorState(const VectorState<A, M> &state, const ArcAllocator &alloc)
: final_(state.Final()),
niepsilons_(state.NumInputEpsilons()),
noepsilons_(state.NumOutputEpsilons()),
arcs_(state.arcs_.begin(), state.arcs_.end(), alloc) {}
void Reset() {
final_ = Weight::Zero();
niepsilons_ = 0;
noepsilons_ = 0;
arcs_.clear();
}
Weight Final() const { return final_; }
size_t NumInputEpsilons() const { return niepsilons_; }
size_t NumOutputEpsilons() const { return noepsilons_; }
size_t NumArcs() const { return arcs_.size(); }
const A &GetArc(size_t n) const { return arcs_[n]; }
const A *Arcs() const { return arcs_.size() > 0 ? &arcs_[0] : 0; }
A *MutableArcs() { return arcs_.size() > 0 ? &arcs_[0] : 0; }
void ReserveArcs(size_t n) { arcs_.reserve(n); }
void SetFinal(Weight final) { final_ = final; }
void SetNumInputEpsilons(size_t n) { niepsilons_ = n; }
void SetNumOutputEpsilons(size_t n) { noepsilons_ = n; }
void AddArc(const A &arc) {
if (arc.ilabel == 0) ++niepsilons_;
if (arc.olabel == 0) ++noepsilons_;
arcs_.push_back(arc);
}
void SetArc(const A &arc, size_t n) {
if (arcs_[n].ilabel == 0) --niepsilons_;
if (arcs_[n].olabel == 0) --noepsilons_;
if (arc.ilabel == 0) ++niepsilons_;
if (arc.olabel == 0) ++noepsilons_;
arcs_[n] = arc;
}
void DeleteArcs() {
niepsilons_ = 0;
noepsilons_ = 0;
arcs_.clear();
}
void DeleteArcs(size_t n) {
for (size_t i = 0; i < n; ++i) {
if (arcs_.back().ilabel == 0) --niepsilons_;
if (arcs_.back().olabel == 0) --noepsilons_;
arcs_.pop_back();
}
}
// For state class allocation
void *operator new(size_t size, StateAllocator *alloc) {
return alloc->allocate(1);
}
// For state destruction and memory freeing
static void Destroy(VectorState<A, M> *state, StateAllocator *alloc) {
if (state) {
state->~VectorState<A, M>();
alloc->deallocate(state, 1);
}
}
private:
Weight final_; // Final weight
size_t niepsilons_; // # of input epsilons
size_t noepsilons_; // # of output epsilons
std::vector<A, ArcAllocator> arcs_; // Arcs represenation
DISALLOW_COPY_AND_ASSIGN(VectorState);
};
// States are implemented by STL vectors, templated on the
// State definition. This does not manage the Fst properties.
template <class S>
class VectorFstBaseImpl : public FstImpl<typename S::Arc> {
public:
typedef S State;
typedef typename State::Arc Arc;
typedef typename Arc::Weight Weight;
typedef typename Arc::StateId StateId;
VectorFstBaseImpl() : start_(kNoStateId) {}
~VectorFstBaseImpl() override {
for (StateId s = 0; s < states_.size(); ++s)
State::Destroy(states_[s], &state_alloc_);
}
StateId Start() const { return start_; }
Weight Final(StateId s) const { return states_[s]->Final(); }
StateId NumStates() const { return states_.size(); }
size_t NumArcs(StateId s) const { return states_[s]->NumArcs(); }
size_t NumInputEpsilons(StateId s) const {
return GetState(s)->NumInputEpsilons();
}
size_t NumOutputEpsilons(StateId s) const {
return GetState(s)->NumOutputEpsilons();
}
void SetStart(StateId s) { start_ = s; }
void SetFinal(StateId s, Weight w) { states_[s]->SetFinal(w); }
StateId AddState() {
states_.push_back(new (&state_alloc_) State(arc_alloc_));
return states_.size() - 1;
}
StateId AddState(State *state) {
states_.push_back(state);
return states_.size() - 1;
}
void AddArc(StateId s, const Arc &arc) { states_[s]->AddArc(arc); }
void DeleteStates(const std::vector<StateId> &dstates) {
std::vector<StateId> newid(states_.size(), 0);
for (size_t i = 0; i < dstates.size(); ++i) newid[dstates[i]] = kNoStateId;
StateId nstates = 0;
for (StateId s = 0; s < states_.size(); ++s) {
if (newid[s] != kNoStateId) {
newid[s] = nstates;
if (s != nstates) states_[nstates] = states_[s];
++nstates;
} else {
State::Destroy(states_[s], &state_alloc_);
}
}
states_.resize(nstates);
for (StateId s = 0; s < states_.size(); ++s) {
Arc *arcs = states_[s]->MutableArcs();
size_t narcs = 0;
size_t nieps = states_[s]->NumInputEpsilons();
size_t noeps = states_[s]->NumOutputEpsilons();
for (size_t i = 0; i < states_[s]->NumArcs(); ++i) {
StateId t = newid[arcs[i].nextstate];
if (t != kNoStateId) {
arcs[i].nextstate = t;
if (i != narcs) arcs[narcs] = arcs[i];
++narcs;
} else {
if (arcs[i].ilabel == 0) --nieps;
if (arcs[i].olabel == 0) --noeps;
}
}
states_[s]->DeleteArcs(states_[s]->NumArcs() - narcs);
states_[s]->SetNumInputEpsilons(nieps);
states_[s]->SetNumOutputEpsilons(noeps);
}
if (Start() != kNoStateId) SetStart(newid[Start()]);
}
void DeleteStates() {
for (StateId s = 0; s < states_.size(); ++s)
State::Destroy(states_[s], &state_alloc_);
states_.clear();
SetStart(kNoStateId);
}
void DeleteArcs(StateId s, size_t n) { states_[s]->DeleteArcs(n); }
void DeleteArcs(StateId s) { states_[s]->DeleteArcs(); }
State *GetState(StateId s) { return states_[s]; }
const State *GetState(StateId s) const { return states_[s]; }
void SetState(StateId s, State *state) { states_[s] = state; }
void ReserveStates(StateId n) { states_.reserve(n); }
void ReserveArcs(StateId s, size_t n) { states_[s]->ReserveArcs(n); }
// Provide information needed for generic state iterator
void InitStateIterator(StateIteratorData<Arc> *data) const {
data->base = 0;
data->nstates = states_.size();
}
// Provide information needed for generic arc iterator
void InitArcIterator(StateId s, ArcIteratorData<Arc> *data) const {
data->base = 0;
data->narcs = states_[s]->NumArcs();
data->arcs = states_[s]->Arcs();
data->ref_count = 0;
}
private:
std::vector<State *> states_; // States represenation.
StateId start_; // initial state
typename State::StateAllocator state_alloc_; // for state allocation
typename State::ArcAllocator arc_alloc_; // for arc allocation
DISALLOW_COPY_AND_ASSIGN(VectorFstBaseImpl);
};
// This is a VectorFstBaseImpl container that holds VectorState's. It
// manages Fst properties.
template <class S>
class VectorFstImpl : public VectorFstBaseImpl<S> {
public:
typedef S State;
typedef typename S::Arc A;
using FstImpl<A>::SetInputSymbols;
using FstImpl<A>::SetOutputSymbols;
using FstImpl<A>::SetType;
using FstImpl<A>::SetProperties;
using FstImpl<A>::Properties;
using VectorFstBaseImpl<S>::Start;
using VectorFstBaseImpl<S>::NumStates;
using VectorFstBaseImpl<S>::GetState;
using VectorFstBaseImpl<S>::ReserveArcs;
friend class MutableArcIterator<VectorFst<A, S>>;
typedef VectorFstBaseImpl<S> BaseImpl;
typedef typename A::Weight Weight;
typedef typename A::StateId StateId;
VectorFstImpl() {
SetType("vector");
SetProperties(kNullProperties | kStaticProperties);
}
explicit VectorFstImpl(const Fst<A> &fst);
static VectorFstImpl<S> *Read(std::istream &strm, const FstReadOptions &opts);
void SetStart(StateId s) {
BaseImpl::SetStart(s);
SetProperties(SetStartProperties(Properties()));
}
void SetFinal(StateId s, Weight w) {
Weight ow = BaseImpl::Final(s);
BaseImpl::SetFinal(s, w);
SetProperties(SetFinalProperties(Properties(), ow, w));
}
StateId AddState() {
StateId s = BaseImpl::AddState();
SetProperties(AddStateProperties(Properties()));
return s;
}
void AddArc(StateId s, const A &arc) {
State *state = GetState(s);
const A *parc =
state->NumArcs() == 0 ? 0 : &(state->GetArc(state->NumArcs() - 1));
SetProperties(AddArcProperties(Properties(), s, arc, parc));
BaseImpl::AddArc(s, arc);
}
void DeleteStates(const std::vector<StateId> &dstates) {
BaseImpl::DeleteStates(dstates);
SetProperties(DeleteStatesProperties(Properties()));
}
void DeleteStates() {
BaseImpl::DeleteStates();
SetProperties(DeleteAllStatesProperties(Properties(), kStaticProperties));
}
void DeleteArcs(StateId s, size_t n) {
BaseImpl::DeleteArcs(s, n);
SetProperties(DeleteArcsProperties(Properties()));
}
void DeleteArcs(StateId s) {
BaseImpl::DeleteArcs(s);
SetProperties(DeleteArcsProperties(Properties()));
}
// Properties always true of this Fst class
static const uint64 kStaticProperties = kExpanded | kMutable;
private:
// Current file format version
static const int kFileVersion = 2;
// Minimum file format version supported
static const int kMinFileVersion = 1;
DISALLOW_COPY_AND_ASSIGN(VectorFstImpl);
};
template <class S>
const uint64 VectorFstImpl<S>::kStaticProperties;
template <class S>
const int VectorFstImpl<S>::kFileVersion;
template <class S>
const int VectorFstImpl<S>::kMinFileVersion;
template <class S>
VectorFstImpl<S>::VectorFstImpl(const Fst<A> &fst) {
SetType("vector");
SetInputSymbols(fst.InputSymbols());
SetOutputSymbols(fst.OutputSymbols());
BaseImpl::SetStart(fst.Start());
if (fst.Properties(kExpanded, false))
BaseImpl::ReserveStates(CountStates(fst));
for (StateIterator<Fst<A>> siter(fst); !siter.Done(); siter.Next()) {
StateId s = siter.Value();
BaseImpl::AddState();
BaseImpl::SetFinal(s, fst.Final(s));
ReserveArcs(s, fst.NumArcs(s));
for (ArcIterator<Fst<A>> aiter(fst, s); !aiter.Done(); aiter.Next()) {
const A &arc = aiter.Value();
BaseImpl::AddArc(s, arc);
}
}
SetProperties(fst.Properties(kCopyProperties, false) | kStaticProperties);
}
template <class S>
VectorFstImpl<S> *VectorFstImpl<S>::Read(std::istream &strm,
const FstReadOptions &opts) {
VectorFstImpl<S> *impl = new VectorFstImpl;
FstHeader hdr;
if (!impl->ReadHeader(strm, opts, kMinFileVersion, &hdr)) {
delete impl;
return nullptr;
}
impl->BaseImpl::SetStart(hdr.Start());
if (hdr.NumStates() != kNoStateId) {
impl->ReserveStates(hdr.NumStates());
}
StateId s = 0;
for (; hdr.NumStates() == kNoStateId || s < hdr.NumStates(); ++s) {
typename A::Weight final;
if (!final.Read(strm)) break;
impl->BaseImpl::AddState();
State *state = impl->GetState(s);
state->SetFinal(final);
int64 narcs;
ReadType(strm, &narcs);
if (!strm) {
LOG(ERROR) << "VectorFst::Read: Read failed: " << opts.source;
delete impl;
return nullptr;
}
impl->ReserveArcs(s, narcs);
for (size_t j = 0; j < narcs; ++j) {
A arc;
ReadType(strm, &arc.ilabel);
ReadType(strm, &arc.olabel);
arc.weight.Read(strm);
ReadType(strm, &arc.nextstate);
if (!strm) {
LOG(ERROR) << "VectorFst::Read: Read failed: " << opts.source;
delete impl;
return nullptr;
}
impl->BaseImpl::AddArc(s, arc);
}
}
if (hdr.NumStates() != kNoStateId && s != hdr.NumStates()) {
LOG(ERROR) << "VectorFst::Read: Unexpected end of file: " << opts.source;
delete impl;
return nullptr;
}
return impl;
}
// Converts a string into a weight.
template <class W>
class WeightFromString {
public:
W operator()(const string &s);
};
// Generic case fails.
template <class W>
inline W WeightFromString<W>::operator()(const string &s) {
LOG(ERROR) << "VectorFst::Read: Obsolete file format";
return W::NoWeight();
}
// TropicalWeight version.
template <>
inline TropicalWeight WeightFromString<TropicalWeight>::operator()(
const string &s) {
float f;
memcpy(&f, s.data(), sizeof(f));
return TropicalWeight(f);
}
// LogWeight version.
template <>
inline LogWeight WeightFromString<LogWeight>::operator()(const string &s) {
float f;
memcpy(&f, s.data(), sizeof(f));
return LogWeight(f);
}
// Simple concrete, mutable FST. This class attaches interface to
// implementation and handles reference counting, delegating most
// methods to ImplToMutableFst. Supports additional operations:
// ReserveStates and ReserveArcs (cf. STL vectors). The second
// optional template argument gives the State definition (default
// declared in fst-decl.h).
template <class A, class S /* = VectorState<A> */>
class VectorFst : public ImplToMutableFst<VectorFstImpl<S>> {
public:
friend class StateIterator<VectorFst<A, S>>;
friend class ArcIterator<VectorFst<A, S>>;
friend class MutableArcIterator<VectorFst<A, S>>;
template <class F, class G>
friend void Cast(const F &, G *);
typedef A Arc;
typedef typename A::StateId StateId;
typedef S State;
typedef VectorFstImpl<State> Impl;
VectorFst() : ImplToMutableFst<Impl>(std::make_shared<Impl>()) {}
explicit VectorFst(const Fst<A> &fst)
: ImplToMutableFst<Impl>(std::make_shared<Impl>(fst)) {}
VectorFst(const VectorFst<A, S> &fst, bool safe = false)
: ImplToMutableFst<Impl>(fst) {}
// Get a copy of this VectorFst. See Fst<>::Copy() for further doc.
VectorFst<A, S> *Copy(bool safe = false) const override {
return new VectorFst<A, S>(*this, safe);
}
VectorFst<A, S> &operator=(const VectorFst<A, S> &fst) {
SetImpl(fst.GetSharedImpl());
return *this;
}
VectorFst<A, S> &operator=(const Fst<A> &fst) override {
if (this != &fst) SetImpl(std::make_shared<Impl>(fst));
return *this;
}
// Read a VectorFst from an input stream; return NULL on error
static VectorFst<A, S> *Read(std::istream &strm, const FstReadOptions &opts) {
Impl *impl = Impl::Read(strm, opts);
return impl ? new VectorFst<A, S>(std::shared_ptr<Impl>(impl)) : nullptr;
}
// Read a VectorFst from a file; return NULL on error
// Empty filename reads from standard input
static VectorFst<A, S> *Read(const string &filename) {
Impl *impl = ImplToExpandedFst<Impl, MutableFst<A>>::Read(filename);
return impl ? new VectorFst<A, S>(std::shared_ptr<Impl>(impl)) : nullptr;
}
bool Write(std::ostream &strm, const FstWriteOptions &opts) const override {
return WriteFst(*this, strm, opts);
}
bool Write(const string &filename) const override {
return Fst<A>::WriteFile(filename);
}
template <class F>
static bool WriteFst(const F &fst, std::ostream &strm,
const FstWriteOptions &opts);
void InitStateIterator(StateIteratorData<Arc> *data) const override {
GetImpl()->InitStateIterator(data);
}
void InitArcIterator(StateId s, ArcIteratorData<Arc> *data) const override {
GetImpl()->InitArcIterator(s, data);
}
inline void InitMutableArcIterator(StateId s,
MutableArcIteratorData<A> *) override;
using ImplToMutableFst<Impl, MutableFst<A>>::ReserveArcs;
using ImplToMutableFst<Impl, MutableFst<A>>::ReserveStates;
private:
using ImplToMutableFst<Impl, MutableFst<A>>::GetImpl;
using ImplToMutableFst<Impl, MutableFst<A>>::MutateCheck;
using ImplToMutableFst<Impl, MutableFst<A>>::SetImpl;
explicit VectorFst(std::shared_ptr<Impl> impl)
: ImplToMutableFst<Impl>(impl) {}
};
// Specialization for VectorFst; see generic version in fst.h
// for sample usage (but use the VectorFst type!). This version
// should inline.
template <class A, class S>
class StateIterator<VectorFst<A, S>> {
public:
typedef typename A::StateId StateId;
explicit StateIterator(const VectorFst<A, S> &fst)
: nstates_(fst.GetImpl()->NumStates()), s_(0) {}
bool Done() const { return s_ >= nstates_; }
StateId Value() const { return s_; }
void Next() { ++s_; }
void Reset() { s_ = 0; }
private:
StateId nstates_;
StateId s_;
DISALLOW_COPY_AND_ASSIGN(StateIterator);
};
// Writes Fst to file, will call CountStates so may involve two passes if
// called from an Fst that is not derived from Expanded.
template <class A, class S>
template <class F>
bool VectorFst<A, S>::WriteFst(const F &fst, std::ostream &strm,
const FstWriteOptions &opts) {
static const int kFileVersion = 2;
bool update_header = true;
FstHeader hdr;
hdr.SetStart(fst.Start());
hdr.SetNumStates(kNoStateId);
size_t start_offset = 0;
if (fst.Properties(kExpanded, false) || opts.stream_write ||
(start_offset = strm.tellp()) != -1) {
hdr.SetNumStates(CountStates(fst));
update_header = false;
}
uint64 properties =
fst.Properties(kCopyProperties, false) | Impl::kStaticProperties;
FstImpl<A>::WriteFstHeader(fst, strm, opts, kFileVersion, "vector",
properties, &hdr);
StateId num_states = 0;
for (StateIterator<F> siter(fst); !siter.Done(); siter.Next()) {
typename A::StateId s = siter.Value();
fst.Final(s).Write(strm);
int64 narcs = fst.NumArcs(s);
WriteType(strm, narcs);
for (ArcIterator<F> aiter(fst, s); !aiter.Done(); aiter.Next()) {
const A &arc = aiter.Value();
WriteType(strm, arc.ilabel);
WriteType(strm, arc.olabel);
arc.weight.Write(strm);
WriteType(strm, arc.nextstate);
}
num_states++;
}
strm.flush();
if (!strm) {
LOG(ERROR) << "VectorFst::Write: Write failed: " << opts.source;
return false;
}
if (update_header) {
hdr.SetNumStates(num_states);
return FstImpl<A>::UpdateFstHeader(fst, strm, opts, kFileVersion, "vector",
properties, &hdr, start_offset);
} else {
if (num_states != hdr.NumStates()) {
LOG(ERROR) << "Inconsistent number of states observed during write";
return false;
}
}
return true;
}
// Specialization for VectorFst; see generic version in fst.h
// for sample usage (but use the VectorFst type!). This version
// should inline.
template <class A, class S>
class ArcIterator<VectorFst<A, S>> {
public:
typedef typename A::StateId StateId;
ArcIterator(const VectorFst<A, S> &fst, StateId s)
: arcs_(fst.GetImpl()->GetState(s)->Arcs()),
narcs_(fst.GetImpl()->GetState(s)->NumArcs()),
i_(0) {}
bool Done() const { return i_ >= narcs_; }
const A &Value() const { return arcs_[i_]; }
void Next() { ++i_; }
void Reset() { i_ = 0; }
void Seek(size_t a) { i_ = a; }
size_t Position() const { return i_; }
uint32 Flags() const { return kArcValueFlags; }
void SetFlags(uint32 f, uint32 m) {}
private:
const A *arcs_;
size_t narcs_;
size_t i_;
DISALLOW_COPY_AND_ASSIGN(ArcIterator);
};
// Specialization for VectorFst; see generic version in fst.h
// for sample usage (but use the VectorFst type!). This version
// should inline.
template <class A, class S>
class MutableArcIterator<VectorFst<A, S>> : public MutableArcIteratorBase<A> {
public:
typedef S State;
typedef typename A::StateId StateId;
typedef typename A::Weight Weight;
MutableArcIterator(VectorFst<A, S> *fst, StateId s) : i_(0) {
fst->MutateCheck();
state_ = fst->GetMutableImpl()->GetState(s);
properties_ = &fst->GetImpl()->properties_;
}
bool Done() const { return i_ >= state_->NumArcs(); }
const A &Value() const { return state_->GetArc(i_); }
void Next() { ++i_; }
size_t Position() const { return i_; }
void Reset() { i_ = 0; }
void Seek(size_t a) { i_ = a; }
void SetValue(const A &arc) {
const A &oarc = state_->GetArc(i_);
if (oarc.ilabel != oarc.olabel) *properties_ &= ~kNotAcceptor;
if (oarc.ilabel == 0) {
*properties_ &= ~kIEpsilons;
if (oarc.olabel == 0) *properties_ &= ~kEpsilons;
}
if (oarc.olabel == 0) {
*properties_ &= ~kOEpsilons;
}
if (oarc.weight != Weight::Zero() && oarc.weight != Weight::One())
*properties_ &= ~kWeighted;
state_->SetArc(arc, i_);
if (arc.ilabel != arc.olabel) {
*properties_ |= kNotAcceptor;
*properties_ &= ~kAcceptor;
}
if (arc.ilabel == 0) {
*properties_ |= kIEpsilons;
*properties_ &= ~kNoIEpsilons;
if (arc.olabel == 0) {
*properties_ |= kEpsilons;
*properties_ &= ~kNoEpsilons;
}
}
if (arc.olabel == 0) {
*properties_ |= kOEpsilons;
*properties_ &= ~kNoOEpsilons;
}
if (arc.weight != Weight::Zero() && arc.weight != Weight::One()) {
*properties_ |= kWeighted;
*properties_ &= ~kUnweighted;
}
*properties_ &= kSetArcProperties | kAcceptor | kNotAcceptor | kEpsilons |
kNoEpsilons | kIEpsilons | kNoIEpsilons | kOEpsilons |
kNoOEpsilons | kWeighted | kUnweighted;
}
uint32 Flags() const { return kArcValueFlags; }
void SetFlags(uint32 f, uint32 m) {}
private:
// This allows base-class virtual access to non-virtual derived-
// class members of the same name. It makes the derived class more
// efficient to use but unsafe to further derive.
bool Done_() const override { return Done(); }
const A &Value_() const override { return Value(); }
void Next_() override { Next(); }
size_t Position_() const override { return Position(); }
void Reset_() override { Reset(); }
void Seek_(size_t a) override { Seek(a); }
void SetValue_(const A &a) override { SetValue(a); }
uint32 Flags_() const override { return Flags(); }
void SetFlags_(uint32 f, uint32 m) override { SetFlags(f, m); }
State *state_;
uint64 *properties_;
size_t i_;
DISALLOW_COPY_AND_ASSIGN(MutableArcIterator);
};
// Provide information needed for the generic mutable arc iterator
template <class A, class S>
inline void VectorFst<A, S>::InitMutableArcIterator(
StateId s, MutableArcIteratorData<A> *data) {
data->base = new MutableArcIterator<VectorFst<A, S>>(this, s);
}
// A useful alias when using StdArc.
typedef VectorFst<StdArc> StdVectorFst;
} // namespace fst
#endif // FST_LIB_VECTOR_FST_H_
|