Home
last modified time | relevance | path

Searched refs:Upper (Results 1 – 25 of 378) sorted by relevance

12345678910>>...16

/external/llvm/lib/IR/
DConstantRange.cpp36 Lower = Upper = APInt::getMaxValue(BitWidth); in ConstantRange()
38 Lower = Upper = APInt::getMinValue(BitWidth); in ConstantRange()
44 : Lower(std::move(V)), Upper(Lower + 1) {} in ConstantRange()
47 : Lower(std::move(L)), Upper(std::move(U)) { in ConstantRange()
48 assert(Lower.getBitWidth() == Upper.getBitWidth() && in ConstantRange()
50 assert((Lower != Upper || (Lower.isMaxValue() || Lower.isMinValue())) && in ConstantRange()
230 return Lower == Upper && Lower.isMaxValue(); in isFullSet()
236 return Lower == Upper && Lower.isMinValue(); in isEmptySet()
243 return Lower.ugt(Upper); in isWrappedSet()
264 return (Upper - Lower).zext(getBitWidth()+1); in getSetSize()
[all …]
/external/eigen/test/
Dtriangular.cpp33 MatrixType m1up = m1.template triangularView<Upper>(); in triangular_square()
34 MatrixType m2up = m2.template triangularView<Upper>(); in triangular_square()
48 r1.template triangularView<Upper>() += m1; in triangular_square()
54 m1.template triangularView<Upper>() = m2.transpose() + m2; in triangular_square()
72 m3 = m1.template triangularView<Upper>(); in triangular_square()
75 …VERIFY(v2.isApprox(m3.transpose() * (m1.transpose().template triangularView<Upper>().solve(v2)), l… in triangular_square()
76 m3 = m1.template triangularView<Upper>(); in triangular_square()
77 VERIFY(v2.isApprox(m3 * (m1.template triangularView<Upper>().solve(v2)), largerEps)); in triangular_square()
82 m3 = m1.template triangularView<Upper>(); in triangular_square()
85 …VERIFY(m2.isApprox(m3.transpose() * (m1.transpose().template triangularView<Upper>().solve(m2)), l… in triangular_square()
[all …]
Dproduct_mmtr.cpp49 CHECK_MMTR(matc, Upper, = s*(soc*soc.adjoint())); in mmtr()
51 CHECK_MMTR(matr, Upper, = soc*(s*sor.adjoint())); in mmtr()
54 CHECK_MMTR(matc, Upper, += s*(soc*sor.transpose())); in mmtr()
56 CHECK_MMTR(matr, Upper, += soc*(s*soc.adjoint())); in mmtr()
59 CHECK_MMTR(matc, Upper, -= s*(osc.transpose()*osc.conjugate())); in mmtr()
61 CHECK_MMTR(matr, Upper, -= soc*(s*soc.adjoint())); in mmtr()
63 CHECK_MMTR(matc, Lower, -= s*sqr*sqc.template triangularView<Upper>()); in mmtr()
64 CHECK_MMTR(matc, Upper, = s*sqc*sqr.template triangularView<Upper>()); in mmtr()
66 CHECK_MMTR(matc, Upper, = s*sqc*sqc.template triangularView<Lower>()); in mmtr()
68 CHECK_MMTR(matc, Lower, = (s*sqr).template triangularView<Upper>()*sqc); in mmtr()
[all …]
Dsparse_permutations.cpp64 up = mat.template triangularView<Upper>(); in sparse_permutations()
67 up_sym_d = mat_d.template selfadjointView<Upper>(); in sparse_permutations()
71 VERIFY_IS_APPROX(up, DenseMatrix(mat_d.template triangularView<Upper>())); in sparse_permutations()
111 VERIFY( is_sorted( res = mat.template selfadjointView<Upper>().twistedBy(p_null) )); in sparse_permutations()
120 VERIFY( is_sorted( res = up.template selfadjointView<Upper>().twistedBy(p_null) )); in sparse_permutations()
129 VERIFY( is_sorted( res = mat.template selfadjointView<Upper>() )); in sparse_permutations()
137 VERIFY( is_sorted( res = up.template selfadjointView<Upper>() )); in sparse_permutations()
146 res.template selfadjointView<Upper>() = mat.template selfadjointView<Upper>(); in sparse_permutations()
147 res_d = up_sym_d.template triangularView<Upper>(); in sparse_permutations()
150 res.template selfadjointView<Lower>() = mat.template selfadjointView<Upper>(); in sparse_permutations()
[all …]
Dproduct_syrk.cpp46 VERIFY_IS_APPROX(m2.template selfadjointView<Upper>().rankUpdate(rhs2,s1)._expression(), in syrk()
47 … (s1 * rhs2 * rhs2.adjoint()).eval().template triangularView<Upper>().toDenseMatrix()); in syrk()
49 …VERIFY_IS_APPROX((m2.template triangularView<Upper>() += s1 * rhs22 * rhs2.adjoint()).nestedExpres… in syrk()
50 … (s1 * rhs22 * rhs2.adjoint()).eval().template triangularView<Upper>().toDenseMatrix()); in syrk()
62 VERIFY_IS_APPROX(m2.template selfadjointView<Upper>().rankUpdate(rhs1.adjoint(),s1)._expression(), in syrk()
63 … (s1 * rhs1.adjoint() * rhs1).eval().template triangularView<Upper>().toDenseMatrix()); in syrk()
64 …VERIFY_IS_APPROX((m2.template triangularView<Upper>() = s1 * rhs1.adjoint() * rhs11).nestedExpress… in syrk()
65 … (s1 * rhs1.adjoint() * rhs11).eval().template triangularView<Upper>().toDenseMatrix()); in syrk()
73 VERIFY_IS_APPROX(m2.template selfadjointView<Upper>().rankUpdate(rhs3.adjoint(),s1)._expression(), in syrk()
74 … (s1 * rhs3.adjoint() * rhs3).eval().template triangularView<Upper>().toDenseMatrix()); in syrk()
[all …]
Dnomalloc.cpp58 m2.col(0).noalias() = m1.template triangularView<Upper>() * m1.col(0); in nomalloc()
59 m2.col(0).noalias() -= m1.adjoint().template triangularView<Upper>() * m1.col(0); in nomalloc()
60 m2.col(0).noalias() -= m1.template triangularView<Upper>() * m1.row(0).adjoint(); in nomalloc()
61 m2.col(0).noalias() -= m1.adjoint().template triangularView<Upper>() * m1.row(0).adjoint(); in nomalloc()
63 m2.row(0).noalias() = m1.row(0) * m1.template triangularView<Upper>(); in nomalloc()
64 m2.row(0).noalias() -= m1.row(0) * m1.adjoint().template triangularView<Upper>(); in nomalloc()
65 m2.row(0).noalias() -= m1.col(0).adjoint() * m1.template triangularView<Upper>(); in nomalloc()
66 m2.row(0).noalias() -= m1.col(0).adjoint() * m1.adjoint().template triangularView<Upper>(); in nomalloc()
69 m2.col(0).noalias() = m1.template selfadjointView<Upper>() * m1.col(0); in nomalloc()
70 m2.col(0).noalias() -= m1.adjoint().template selfadjointView<Upper>() * m1.col(0); in nomalloc()
[all …]
Dsparse_solvers.cpp58 VERIFY_IS_APPROX(refMat2.template triangularView<Upper>().solve(vec2), in sparse_solvers()
59 m2.template triangularView<Upper>().solve(vec3)); in sparse_solvers()
60 VERIFY_IS_APPROX(refMat2.conjugate().template triangularView<Upper>().solve(vec2), in sparse_solvers()
61 m2.conjugate().template triangularView<Upper>().solve(vec3)); in sparse_solvers()
66 VERIFY_IS_APPROX(refMat2.conjugate().template triangularView<Upper>().solve(vec2), in sparse_solvers()
67 mm2.conjugate().template triangularView<Upper>().solve(vec3)); in sparse_solvers()
72 VERIFY_IS_APPROX(refMat2.transpose().template triangularView<Upper>().solve(vec2), in sparse_solvers()
73 m2.transpose().template triangularView<Upper>().solve(vec3)); in sparse_solvers()
93 refMat2.template triangularView<Upper>().solveInPlace(refMatB); in sparse_solvers()
94 m2.template triangularView<Upper>().solveInPlace(matB); in sparse_solvers()
Dcholmod_support.cpp18 …CholmodDecomposition<SparseMatrix<T>, Upper> g_chol_colmajor_upper; g_chol_colmajor_upper.setMode(… in test_cholmod_T()
20 …CholmodDecomposition<SparseMatrix<T>, Upper> g_llt_colmajor_upper; g_llt_colmajor_upper.setMode(C… in test_cholmod_T()
22 …CholmodDecomposition<SparseMatrix<T>, Upper> g_ldlt_colmajor_upper; g_ldlt_colmajor_upper.setMode(… in test_cholmod_T()
25 CholmodSupernodalLLT<SparseMatrix<T>, Upper> chol_colmajor_upper; in test_cholmod_T()
27 CholmodSimplicialLLT<SparseMatrix<T>, Upper> llt_colmajor_upper; in test_cholmod_T()
29 CholmodSimplicialLDLT<SparseMatrix<T>, Upper> ldlt_colmajor_upper; in test_cholmod_T()
Dincomplete_cholesky.cpp20 …ConjugateGradient<SparseMatrixType, Upper, IncompleteCholesky<T, Upper, AMDOrdering<I> > > … in test_incomplete_cholesky_T()
21 …ConjugateGradient<SparseMatrixType, Upper, IncompleteCholesky<T, Upper, NaturalOrdering<I> > > … in test_incomplete_cholesky_T()
22 …ConjugateGradient<SparseMatrixType, Upper|Lower, IncompleteCholesky<T, Lower, AMDOrdering<I> > > … in test_incomplete_cholesky_T()
59 Eigen::Lower | Eigen::Upper, in test_incomplete_cholesky()
/external/swiftshader/third_party/llvm-10.0/llvm/lib/IR/
DConstantRange.cpp44 Upper(Lower) {} in ConstantRange()
47 : Lower(std::move(V)), Upper(Lower + 1) {} in ConstantRange()
50 : Lower(std::move(L)), Upper(std::move(U)) { in ConstantRange()
51 assert(Lower.getBitWidth() == Upper.getBitWidth() && in ConstantRange()
53 assert((Lower != Upper || (Lower.isMaxValue() || Lower.isMinValue())) && in ConstantRange()
71 APInt Lower = Known.getMinValue(), Upper = Known.getMaxValue(); in fromKnownBits() local
73 Upper.clearSignBit(); in fromKnownBits()
74 return ConstantRange(Lower, Upper + 1); in fromKnownBits()
210 APInt Lower, Upper; in makeExactMulNSWRegion() local
213 Upper = APIntOps::RoundingSDiv(MinValue, V, APInt::Rounding::DOWN); in makeExactMulNSWRegion()
[all …]
/external/llvm-project/llvm/lib/IR/
DConstantRange.cpp45 Upper(Lower) {} in ConstantRange()
48 : Lower(std::move(V)), Upper(Lower + 1) {} in ConstantRange()
51 : Lower(std::move(L)), Upper(std::move(U)) { in ConstantRange()
52 assert(Lower.getBitWidth() == Upper.getBitWidth() && in ConstantRange()
54 assert((Lower != Upper || (Lower.isMaxValue() || Lower.isMinValue())) && in ConstantRange()
72 APInt Lower = Known.getMinValue(), Upper = Known.getMaxValue(); in fromKnownBits() local
74 Upper.clearSignBit(); in fromKnownBits()
75 return ConstantRange(Lower, Upper + 1); in fromKnownBits()
211 APInt Lower, Upper; in makeExactMulNSWRegion() local
214 Upper = APIntOps::RoundingSDiv(MinValue, V, APInt::Rounding::DOWN); in makeExactMulNSWRegion()
[all …]
/external/clang/lib/StaticAnalyzer/Core/
DRangeConstraintManager.cpp116 const llvm::APSInt &Upper, in IntersectInRange() argument
132 if (i->From() > Upper) { in IntersectInRange()
137 if (i->Includes(Upper)) { in IntersectInRange()
139 BV.getValue(Upper))); in IntersectInRange()
144 if (i->Includes(Upper)) { in IntersectInRange()
145 newRanges = F.add(newRanges, Range(i->From(), BV.getValue(Upper))); in IntersectInRange()
158 bool pin(llvm::APSInt &Lower, llvm::APSInt &Upper) const { in pin()
166 APSIntType::RangeTestResultKind UpperTest = Type.testInRange(Upper, true); in pin()
174 if (Lower <= Upper) in pin()
179 Upper = Type.getMaxValue(); in pin()
[all …]
/external/swiftshader/third_party/llvm-subzero/include/llvm/Support/
DFormat.h160 bool Upper;
167 : HexValue(HV), DecValue(DV), Width(W), Hex(H), Upper(U),
178 bool Upper = false) {
180 return FormattedNumber(N, 0, Width, true, Upper, true);
191 bool Upper = false) {
193 return FormattedNumber(N, 0, Width, true, Upper, false);
214 bool Upper; // Show offset and hex bytes as upper case.
222 ByteGroupSize(BGS), Upper(U), ASCII(A) {
232 uint32_t IndentLevel = 0, bool Upper = false) {
234 ByteGroupSize, Upper, false);
[all …]
/external/protobuf/php/tests/
Dgenerated_class_test.php902 $m = new \Upper\PBABSTRACT();
903 $m = new \Upper\PBAND();
904 $m = new \Upper\PBARRAY();
905 $m = new \Upper\PBAS();
906 $m = new \Upper\PBBREAK();
907 $m = new \Upper\PBCALLABLE();
908 $m = new \Upper\PBCASE();
909 $m = new \Upper\PBCATCH();
910 $m = new \Upper\PBCLASS();
911 $m = new \Upper\PBCLONE();
[all …]
/external/rust/crates/bstr/scripts/regex/
Dsentence.sh103 Upper="\p{sb=Upper}"
111 LetterSepTerm="[$OLetter $Upper $Lower $ParaSep $SATerm]"
120 [$Upper $Lower] $Ex* $ATerm $Ex*
121 $Upper $Ex*
123 ($ATerm $Ex* $Upper $Ex*)*
129 ($ATerm $Ex* $Upper $Ex*)*
150 ($ATerm $Ex* $Upper $Ex*)*
/external/llvm-project/llvm/include/llvm/Support/
DFormat.h169 bool Upper;
176 : HexValue(HV), DecValue(DV), Width(W), Hex(H), Upper(U),
187 bool Upper = false) {
189 return FormattedNumber(N, 0, Width, true, Upper, true);
200 bool Upper = false) {
202 return FormattedNumber(N, 0, Width, true, Upper, false);
223 bool Upper; // Show offset and hex bytes as upper case.
231 ByteGroupSize(BGS), Upper(U), ASCII(A) {
241 uint32_t IndentLevel = 0, bool Upper = false) {
243 ByteGroupSize, Upper, false);
[all …]
/external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Support/
DFormat.h169 bool Upper;
176 : HexValue(HV), DecValue(DV), Width(W), Hex(H), Upper(U),
187 bool Upper = false) {
189 return FormattedNumber(N, 0, Width, true, Upper, true);
200 bool Upper = false) {
202 return FormattedNumber(N, 0, Width, true, Upper, false);
223 bool Upper; // Show offset and hex bytes as upper case.
231 ByteGroupSize(BGS), Upper(U), ASCII(A) {
241 uint32_t IndentLevel = 0, bool Upper = false) {
243 ByteGroupSize, Upper, false);
[all …]
/external/eigen/blas/
Dlevel2_impl.h91 …(internal::triangular_solve_vector<Scalar,Scalar,int,OnTheLeft, Upper|0, false,ColMajor>::ru… in EIGEN_BLAS_FUNC()
100 …(internal::triangular_solve_vector<Scalar,Scalar,int,OnTheLeft, Upper|0, false,RowMajor>::ru… in EIGEN_BLAS_FUNC()
102 …(internal::triangular_solve_vector<Scalar,Scalar,int,OnTheLeft, Upper|0, Conj, RowMajor>::ru… in EIGEN_BLAS_FUNC()
105 …(internal::triangular_solve_vector<Scalar,Scalar,int,OnTheLeft, Upper|UnitDiag,false,ColMajor>::ru… in EIGEN_BLAS_FUNC()
114 …(internal::triangular_solve_vector<Scalar,Scalar,int,OnTheLeft, Upper|UnitDiag,false,RowMajor>::ru… in EIGEN_BLAS_FUNC()
116 …(internal::triangular_solve_vector<Scalar,Scalar,int,OnTheLeft, Upper|UnitDiag,Conj, RowMajor>::ru… in EIGEN_BLAS_FUNC()
150 …(internal::triangular_matrix_vector_product<int,Upper|0, Scalar,false,Scalar,false,ColMajor>… in EIGEN_BLAS_FUNC()
159 …(internal::triangular_matrix_vector_product<int,Upper|0, Scalar,false,Scalar,false,RowMajor>… in EIGEN_BLAS_FUNC()
161 …(internal::triangular_matrix_vector_product<int,Upper|0, Scalar,Conj, Scalar,false,RowMajor>… in EIGEN_BLAS_FUNC()
164 …(internal::triangular_matrix_vector_product<int,Upper|UnitDiag,Scalar,false,Scalar,false,ColMajor>… in EIGEN_BLAS_FUNC()
[all …]
Dlevel3_impl.h85 …(internal::triangular_solve_matrix<Scalar,DenseIndex,OnTheLeft, Upper|0, false,ColMajor,C… in EIGEN_BLAS_FUNC()
92 …(internal::triangular_solve_matrix<Scalar,DenseIndex,OnTheRight,Upper|0, false,ColMajor,C… in EIGEN_BLAS_FUNC()
101 …(internal::triangular_solve_matrix<Scalar,DenseIndex,OnTheLeft, Upper|0, false,RowMajor,C… in EIGEN_BLAS_FUNC()
103 …(internal::triangular_solve_matrix<Scalar,DenseIndex,OnTheLeft, Upper|0, Conj, RowMajor,C… in EIGEN_BLAS_FUNC()
108 …(internal::triangular_solve_matrix<Scalar,DenseIndex,OnTheRight,Upper|0, false,RowMajor,C… in EIGEN_BLAS_FUNC()
110 …(internal::triangular_solve_matrix<Scalar,DenseIndex,OnTheRight,Upper|0, Conj, RowMajor,C… in EIGEN_BLAS_FUNC()
113 …(internal::triangular_solve_matrix<Scalar,DenseIndex,OnTheLeft, Upper|UnitDiag,false,ColMajor,ColM… in EIGEN_BLAS_FUNC()
120 …(internal::triangular_solve_matrix<Scalar,DenseIndex,OnTheRight,Upper|UnitDiag,false,ColMajor,ColM… in EIGEN_BLAS_FUNC()
129 …(internal::triangular_solve_matrix<Scalar,DenseIndex,OnTheLeft, Upper|UnitDiag,false,RowMajor,ColM… in EIGEN_BLAS_FUNC()
131 …(internal::triangular_solve_matrix<Scalar,DenseIndex,OnTheLeft, Upper|UnitDiag,Conj, RowMajor,ColM… in EIGEN_BLAS_FUNC()
[all …]
/external/llvm-project/llvm/include/llvm/IR/
DConstantRange.h48 APInt Lower, Upper; variable
70 ConstantRange(APInt Lower, APInt Upper);
84 static ConstantRange getNonEmpty(APInt Lower, APInt Upper) { in getNonEmpty() argument
85 if (Lower == Upper) in getNonEmpty()
87 return ConstantRange(std::move(Lower), std::move(Upper)); in getNonEmpty()
170 const APInt &getUpper() const { return Upper; } in getUpper()
216 if (Upper == Lower + 1) in getSingleElement()
224 if (Lower == Upper + 1) in getSingleMissingElement()
225 return &Upper; in getSingleMissingElement()
258 return Lower == CR.Lower && Upper == CR.Upper;
/external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/IR/
DConstantRange.h48 APInt Lower, Upper; variable
70 ConstantRange(APInt Lower, APInt Upper);
84 static ConstantRange getNonEmpty(APInt Lower, APInt Upper) { in getNonEmpty() argument
85 if (Lower == Upper) in getNonEmpty()
87 return ConstantRange(std::move(Lower), std::move(Upper)); in getNonEmpty()
162 const APInt &getUpper() const { return Upper; } in getUpper()
208 if (Upper == Lower + 1) in getSingleElement()
216 if (Lower == Upper + 1) in getSingleMissingElement()
217 return &Upper; in getSingleMissingElement()
250 return Lower == CR.Lower && Upper == CR.Upper;
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/
DCaseMap.java46 public static Upper toUpper() { return Upper.DEFAULT; } in toUpper()
133 public static final class Upper extends CaseMap { class in CaseMap
134 private static final Upper DEFAULT = new Upper(0);
135 private static final Upper OMIT_UNCHANGED = new Upper(CaseMapImpl.OMIT_UNCHANGED_TEXT);
136 private Upper(int opt) { super(opt); } in Upper() method in CaseMap.Upper
143 public Upper omitUnchangedText() { in omitUnchangedText()
/external/icu/android_icu4j/src/main/java/android/icu/text/
DCaseMap.java44 public static Upper toUpper() { return Upper.DEFAULT; } in toUpper()
123 public static final class Upper extends CaseMap { class in CaseMap
124 private static final Upper DEFAULT = new Upper(0);
125 private static final Upper OMIT_UNCHANGED = new Upper(CaseMapImpl.OMIT_UNCHANGED_TEXT);
126 private Upper(int opt) { super(opt); } in Upper() method in CaseMap.Upper
132 public Upper omitUnchangedText() { in omitUnchangedText()
/external/rust/crates/bstr/src/unicode/data/
DSentenceBreakTest.txt37 ÷ 0001 × 0041 ÷ # ÷ [0.2] <START OF HEADING> (Other) × [998.0] LATIN CAPITAL LETTER A (Upper) ÷ [0…
38 …G> (Other) × [5.0] COMBINING DIAERESIS (Extend_FE) × [998.0] LATIN CAPITAL LETTER A (Upper) ÷ [0.3]
67 ÷ 000D ÷ 0041 ÷ # ÷ [0.2] <CARRIAGE RETURN (CR)> (CR) ÷ [4.0] LATIN CAPITAL LETTER A (Upper) ÷ [0.…
68 …(CR)> (CR) ÷ [4.0] COMBINING DIAERESIS (Extend_FE) × [998.0] LATIN CAPITAL LETTER A (Upper) ÷ [0.3]
97 ÷ 000A ÷ 0041 ÷ # ÷ [0.2] <LINE FEED (LF)> (LF) ÷ [4.0] LATIN CAPITAL LETTER A (Upper) ÷ [0.3]
98 …(LF)> (LF) ÷ [4.0] COMBINING DIAERESIS (Extend_FE) × [998.0] LATIN CAPITAL LETTER A (Upper) ÷ [0.3]
127 ÷ 0085 ÷ 0041 ÷ # ÷ [0.2] <NEXT LINE (NEL)> (Sep) ÷ [4.0] LATIN CAPITAL LETTER A (Upper) ÷ [0.3]
128 …EL)> (Sep) ÷ [4.0] COMBINING DIAERESIS (Extend_FE) × [998.0] LATIN CAPITAL LETTER A (Upper) ÷ [0.3]
157 ÷ 0009 × 0041 ÷ # ÷ [0.2] <CHARACTER TABULATION> (Sp) × [998.0] LATIN CAPITAL LETTER A (Upper) ÷ […
158 …TION> (Sp) × [5.0] COMBINING DIAERESIS (Extend_FE) × [998.0] LATIN CAPITAL LETTER A (Upper) ÷ [0.3]
[all …]
/external/icu/icu4c/source/test/testdata/
DSentenceBreakTest.txt37 ÷ 0001 × 0041 ÷ # ÷ [0.2] <START OF HEADING> (Other) × [998.0] LATIN CAPITAL LETTER A (Upper) ÷ [0…
38 …G> (Other) × [5.0] COMBINING DIAERESIS (Extend_FE) × [998.0] LATIN CAPITAL LETTER A (Upper) ÷ [0.3]
67 ÷ 000D ÷ 0041 ÷ # ÷ [0.2] <CARRIAGE RETURN (CR)> (CR) ÷ [4.0] LATIN CAPITAL LETTER A (Upper) ÷ [0.…
68 …(CR)> (CR) ÷ [4.0] COMBINING DIAERESIS (Extend_FE) × [998.0] LATIN CAPITAL LETTER A (Upper) ÷ [0.3]
97 ÷ 000A ÷ 0041 ÷ # ÷ [0.2] <LINE FEED (LF)> (LF) ÷ [4.0] LATIN CAPITAL LETTER A (Upper) ÷ [0.3]
98 …(LF)> (LF) ÷ [4.0] COMBINING DIAERESIS (Extend_FE) × [998.0] LATIN CAPITAL LETTER A (Upper) ÷ [0.3]
127 ÷ 0085 ÷ 0041 ÷ # ÷ [0.2] <NEXT LINE (NEL)> (Sep) ÷ [4.0] LATIN CAPITAL LETTER A (Upper) ÷ [0.3]
128 …EL)> (Sep) ÷ [4.0] COMBINING DIAERESIS (Extend_FE) × [998.0] LATIN CAPITAL LETTER A (Upper) ÷ [0.3]
157 ÷ 0009 × 0041 ÷ # ÷ [0.2] <CHARACTER TABULATION> (Sp) × [998.0] LATIN CAPITAL LETTER A (Upper) ÷ […
158 …TION> (Sp) × [5.0] COMBINING DIAERESIS (Extend_FE) × [998.0] LATIN CAPITAL LETTER A (Upper) ÷ [0.3]
[all …]

12345678910>>...16