Lines Matching refs:VLOG
89 VLOG(1) << "Check destructive and delayed union are equivalent."; in TestRational()
98 VLOG(1) << "Check destructive and delayed concatenation are equivalent."; in TestRational()
109 VLOG(1) << "Check destructive and delayed closure* are equivalent."; in TestRational()
117 VLOG(1) << "Check destructive and delayed closure+ are equivalent."; in TestRational()
125 VLOG(1) << "Check union is associative (destructive)."; in TestRational()
139 VLOG(1) << "Check union is associative (delayed)."; in TestRational()
151 VLOG(1) << "Check union is associative (destructive delayed)."; in TestRational()
162 VLOG(1) << "Check concatenation is associative (destructive)."; in TestRational()
176 VLOG(1) << "Check concatenation is associative (delayed)."; in TestRational()
187 VLOG(1) << "Check concatenation is associative (destructive delayed)."; in TestRational()
198 VLOG(1) << "Check concatenation left distributes" in TestRational()
217 VLOG(1) << "Check concatenation right distributes" in TestRational()
235 VLOG(1) << "Check concatenation left distributes over union (delayed)."; in TestRational()
247 VLOG(1) << "Check concatenation right distributes over union (delayed)."; in TestRational()
260 VLOG(1) << "Check T T* == T+ (destructive)."; in TestRational()
274 VLOG(1) << "Check T* T == T+ (destructive)."; in TestRational()
287 VLOG(1) << "Check T T* == T+ (delayed)."; in TestRational()
297 VLOG(1) << "Check T* T == T+ (delayed)."; in TestRational()
311 VLOG(1) << "Check destructive and delayed projection are equivalent."; in TestMap()
320 VLOG(1) << "Check destructive and delayed inversion are equivalent."; in TestMap()
328 VLOG(1) << "Check Pi_1(T) = Pi_2(T^-1) (destructive)."; in TestMap()
338 VLOG(1) << "Check Pi_2(T) = Pi_1(T^-1) (destructive)."; in TestMap()
348 VLOG(1) << "Check Pi_1(T) = Pi_2(T^-1) (delayed)."; in TestMap()
357 VLOG(1) << "Check Pi_2(T) = Pi_1(T^-1) (delayed)."; in TestMap()
366 VLOG(1) << "Check destructive relabeling"; in TestMap()
393 VLOG(1) << "Check on-the-fly relabeling"; in TestMap()
401 VLOG(1) << "Check encoding/decoding (destructive)."; in TestMap()
415 VLOG(1) << "Check encoding/decoding (delayed)."; in TestMap()
429 VLOG(1) << "Check gallic mappers (constructive)."; in TestMap()
440 VLOG(1) << "Check gallic mappers (delayed)."; in TestMap()
469 VLOG(1) << "Check composition is associative."; in TestCompose()
480 VLOG(1) << "Check composition left distributes over union."; in TestCompose()
492 VLOG(1) << "Check composition right distributes over union."; in TestCompose()
511 VLOG(1) << "Check intersection is commutative."; in TestCompose()
518 VLOG(1) << "Check all epsilon filters leads to equivalent results."; in TestCompose()
539 VLOG(1) << "Check arc sorted Fst is equivalent to its input."; in TestSort()
546 VLOG(1) << "Check destructive and delayed arcsort are equivalent."; in TestSort()
554 VLOG(1) << "Check ilabel sorting vs. olabel sorting with inversions."; in TestSort()
565 VLOG(1) << "Check topologically sorted Fst is equivalent to its input."; in TestSort()
572 VLOG(1) << "Check reverse(reverse(T)) = T"; in TestSort()
590 VLOG(1) << "Check connected FST is equivalent to its input."; in TestOptimize()
598 VLOG(1) << "Check epsilon-removed FST is equivalent to its input."; in TestOptimize()
603 VLOG(1) << "Check destructive and delayed epsilon removal" in TestOptimize()
608 VLOG(1) << "Check an FST with a large proportion" in TestOptimize()
637 VLOG(1) << "Check determinized FSA is equivalent to its input."; in TestOptimize()
644 VLOG(1) << "Check size(min(det(A))) <= size(det(A))" in TestOptimize()
656 VLOG(1) << "Check that Revuz's algorithm leads to the" in TestOptimize()
676 VLOG(1) << "Check reweight(T) equiv T"; in TestOptimize()
691 VLOG(1) << "Check pushed FST is equivalent to input FST."; in TestOptimize()
723 VLOG(1) << "Check pruning algorithm"; in TestOptimize()
725 VLOG(1) << "Check equiv. of constructive and destructive algorithms"; in TestOptimize()
735 VLOG(1) << "Check prune(reverse) equiv reverse(prune)"; in TestOptimize()
747 VLOG(1) << "Check: ShortestDistance(T- prune(T))" in TestOptimize()
763 VLOG(1) << "Check synchronize(T) equiv T"; in TestOptimize()
777 VLOG(1) << "Check 1-best weight."; in TestSearch()
786 VLOG(1) << "Check n-best weights"; in TestSearch()
818 VLOG(1) << "Check FSTs for sanity (including property bits)."; in Equiv()
917 VLOG(1) << "Check the union contains its arguments (destructive)."; in TestRational()
926 VLOG(1) << "Check the union contains its arguments (delayed)."; in TestRational()
934 VLOG(1) << "Check if A^n c A* (destructive)."; in TestRational()
946 VLOG(1) << "Check if A^n c A* (delayed)."; in TestRational()
974 VLOG(1) << "Check the intersection is contained in its arguments."; in TestIntersect()
981 VLOG(1) << "Check union distributes over intersection."; in TestIntersect()
1002 VLOG(1) << "Check S U S' = Sigma*"; in TestIntersect()
1008 VLOG(1) << "Check S n S' = {}"; in TestIntersect()
1014 VLOG(1) << "Check (S1' U S2') == (S1 n S2)'"; in TestIntersect()
1024 VLOG(1) << "Check (S1' n S2') == (S1 U S2)'"; in TestIntersect()
1037 VLOG(1) << "Check determinized FSA is equivalent to its input."; in TestOptimize()
1043 VLOG(1) << "Check minimized FSA is equivalent to its input."; in TestOptimize()
1055 VLOG(1) << "Check that Hopcroft's and Revuz's algorithms lead to the" in TestOptimize()
1073 VLOG(1) << "Check FSAs for sanity (including property bits)."; in Equiv()
1110 VLOG(1) << "Check FSAs (incl. property bits) for sanity"; in Subset()
1173 VLOG(1) << "weight type = " << Weight::Type(); in Test()
1246 VLOG(1) << "Check FST for sanity (including property bits)."; in RandFst()