@@ -163,7 +163,7 @@ public void test_xsd_string5() {
163
163
164
164
@ Test
165
165
public void test_lang1 () {
166
- NodeValue nv1 = NodeValue .makeNode (NodeFactory .createLiteral ("abc" , "en" ));
166
+ NodeValue nv1 = NodeValue .makeNode (NodeFactory .createLiteralLang ("abc" , "en" ));
167
167
NodeValue nv2 = NodeValue .makeNode (NodeFactory .createLiteral ("abc" ));
168
168
169
169
int x = NodeCmp .compareRDFTerms (nv1 .asNode (), nv2 .asNode ());
@@ -172,17 +172,17 @@ public void test_lang1() {
172
172
173
173
@ Test
174
174
public void test_lang2 () {
175
- NodeValue nv1 = NodeValue .makeNode (NodeFactory .createLiteral ("abc" , "en" ));
176
- NodeValue nv2 = NodeValue .makeNode (NodeFactory .createLiteral ("abc" , "EN" ));
175
+ NodeValue nv1 = NodeValue .makeNode (NodeFactory .createLiteralLang ("abc" , "en" ));
176
+ NodeValue nv2 = NodeValue .makeNode (NodeFactory .createLiteralLang ("abc" , "EN" ));
177
177
178
178
int x = NodeCmp .compareRDFTerms (nv1 .asNode (), nv2 .asNode ());
179
179
assertTrue ("Lang tags should sort by case" , Expr .CMP_GREATER == x );
180
180
}
181
181
182
182
@ Test
183
183
public void test_lang3 () {
184
- NodeValue nv1 = NodeValue .makeNode (NodeFactory .createLiteral ("ABC" , "en" ));
185
- NodeValue nv2 = NodeValue .makeNode (NodeFactory .createLiteral ("abc" , "EN" ));
184
+ NodeValue nv1 = NodeValue .makeNode (NodeFactory .createLiteralLang ("ABC" , "en" ));
185
+ NodeValue nv2 = NodeValue .makeNode (NodeFactory .createLiteralLang ("abc" , "EN" ));
186
186
187
187
int x = NodeValue .compareAlways (nv1 , nv2 );
188
188
assertTrue ("Lang nodes should sort by lexical if tags value-same" , Expr .CMP_LESS == x );
@@ -192,8 +192,8 @@ public void test_lang3() {
192
192
193
193
@ Test
194
194
public void test_lang4 () {
195
- NodeValue nv1 = NodeValue .makeNode (NodeFactory .createLiteral ("ABC" , "en" ));
196
- NodeValue nv2 = NodeValue .makeNode (NodeFactory .createLiteral ("abc" , "en" ));
195
+ NodeValue nv1 = NodeValue .makeNode (NodeFactory .createLiteralLang ("ABC" , "en" ));
196
+ NodeValue nv2 = NodeValue .makeNode (NodeFactory .createLiteralLang ("abc" , "en" ));
197
197
198
198
int x = NodeValue .compareAlways (nv1 , nv2 );
199
199
assertTrue ("Lang nodes should sort by lexical if tags the same" , Expr .CMP_LESS == x );
@@ -204,7 +204,7 @@ public void test_lang4() {
204
204
@ Test
205
205
public void test_lang5 () {
206
206
NodeValue nv1 = NodeValue .makeNode (NodeFactory .createLiteral ("abc" ));
207
- NodeValue nv2 = NodeValue .makeNode (NodeFactory .createLiteral ("xyz" , "en" ));
207
+ NodeValue nv2 = NodeValue .makeNode (NodeFactory .createLiteralLang ("xyz" , "en" ));
208
208
209
209
int x = NodeValue .compareAlways (nv1 , nv2 );
210
210
assertTrue ("Lang nodes should sort by lexical form if one is plain" , Expr .CMP_LESS == x );
@@ -215,7 +215,7 @@ public void test_lang5() {
215
215
@ Test
216
216
public void test_lang6 () {
217
217
NodeValue nv1 = NodeValue .makeNode (NodeFactory .createLiteral ("xyz" ));
218
- NodeValue nv2 = NodeValue .makeNode (NodeFactory .createLiteral ("abc" , "en" ));
218
+ NodeValue nv2 = NodeValue .makeNode (NodeFactory .createLiteralLang ("abc" , "en" ));
219
219
220
220
int x = NodeValue .compareAlways (nv1 , nv2 );
221
221
assertTrue ("Lang nodes should sort by language before lexical form" , Expr .CMP_LESS == x );
@@ -225,8 +225,8 @@ public void test_lang6() {
225
225
226
226
@ Test
227
227
public void test_lang7 () {
228
- NodeValue nv1 = NodeValue .makeNode (NodeFactory .createLiteral ("xyz" , "de" ));
229
- NodeValue nv2 = NodeValue .makeNode (NodeFactory .createLiteral ("abc" , "en" ));
228
+ NodeValue nv1 = NodeValue .makeNode (NodeFactory .createLiteralLang ("xyz" , "de" ));
229
+ NodeValue nv2 = NodeValue .makeNode (NodeFactory .createLiteralLang ("abc" , "en" ));
230
230
231
231
int x = NodeValue .compareAlways (nv1 , nv2 );
232
232
assertTrue ("Lang nodes should sort by language before lexical form" , Expr .CMP_LESS == x );
@@ -237,7 +237,7 @@ public void test_lang7() {
237
237
@ Test
238
238
public void test_lang8 () {
239
239
NodeValue nv1 = NodeValue .makeNode (NodeFactory .createLiteral ("abc" , XSDDatatype .XSDstring ));
240
- NodeValue nv2 = NodeValue .makeNode (NodeFactory .createLiteral ("xyz" , "en" ));
240
+ NodeValue nv2 = NodeValue .makeNode (NodeFactory .createLiteralLang ("xyz" , "en" ));
241
241
242
242
int x = NodeValue .compareAlways (nv1 , nv2 );
243
243
assertTrue ("Lang nodes should sort by lexical form if other is XSD string" , Expr .CMP_LESS == x );
@@ -248,7 +248,7 @@ public void test_lang8() {
248
248
@ Test
249
249
public void test_lang9 () {
250
250
NodeValue nv1 = NodeValue .makeNode (NodeFactory .createLiteral ("xyz" , XSDDatatype .XSDstring ));
251
- NodeValue nv2 = NodeValue .makeNode (NodeFactory .createLiteral ("abc" , "en" ));
251
+ NodeValue nv2 = NodeValue .makeNode (NodeFactory .createLiteralLang ("abc" , "en" ));
252
252
// xsd:string (RDF 1.1) is a simple string and before @en.
253
253
int x = NodeValue .compareAlways (nv1 , nv2 );
254
254
assertTrue ("Lang nodes should sort by lexical form if other is XSD string" , Expr .CMP_LESS == x );
0 commit comments