1 write to _f
System.Private.Xml (1)
System\Xml\Xsl\XPath\XPathBuilder.cs (1)
58
_f
= _environment.Factory;
163 references to _f
System.Private.Xml (163)
System\Xml\Xsl\XPath\XPathBuilder.cs (163)
38
XPathQilFactory IXPathEnvironment.Factory { get { return
_f
; } }
59
this.fixupCurrent =
_f
.Unknown(T.NodeNotRtf);
60
this.fixupPosition =
_f
.Unknown(T.DoubleX);
61
this.fixupLast =
_f
.Unknown(T.DoubleX);
62
_fixupVisitor = new FixupVisitor(
_f
, fixupCurrent, fixupPosition, fixupLast);
83
result =
_f
.DocOrderDistinct(result);
105
return
_f
.String(value);
110
return
_f
.Double(value);
137
left =
_f
.ConvertToBoolean(left);
138
right =
_f
.ConvertToBoolean(right);
140
op == XPathOperator.Or ?
_f
.Or(left, right) :
141
/*default*/
_f
.And(left, right)
149
left =
_f
.ConvertToType(compType, left);
150
right =
_f
.ConvertToType(compType, right);
154
case XPathOperator.Eq: return
_f
.Eq(left, right);
155
case XPathOperator.Ne: return
_f
.Ne(left, right);
156
case XPathOperator.Lt: return
_f
.Lt(left, right);
157
case XPathOperator.Le: return
_f
.Le(left, right);
158
case XPathOperator.Gt: return
_f
.Gt(left, right);
159
case XPathOperator.Ge: return
_f
.Ge(left, right);
177
QilIterator it =
_f
.For(nodeset);
178
return
_f
.Not(
_f
.IsEmpty(
_f
.Filter(it, CompareValues(op,
_f
.XPathNodeValue(it), val, compType))));
207
QilIterator leftEnd =
_f
.For(left);
208
QilIterator rightEnd =
_f
.For(right);
209
return
_f
.Not(
_f
.IsEmpty(
_f
.Loop(leftEnd,
_f
.Filter(rightEnd, CompareValues(op,
_f
.XPathNodeValue(leftEnd),
_f
.XPathNodeValue(rightEnd), compType)))));
220
return
_f
.InvokeEqualityOperator(s_qilOperator[(int)op], left, right);
253
return
_f
.InvokeRelationalOperator(s_qilOperator[(int)op], left, right);
279
return
_f
.Negate(
_f
.ConvertToNumber(left));
284
left =
_f
.ConvertToNumber(left);
285
right =
_f
.ConvertToNumber(right);
288
case XPathOperator.Plus: return
_f
.Add(left, right);
289
case XPathOperator.Minus: return
_f
.Subtract(left, right);
290
case XPathOperator.Multiply: return
_f
.Multiply(left, right);
291
case XPathOperator.Divide: return
_f
.Divide(left, right);
292
case XPathOperator.Modulo: return
_f
.Modulo(left, right);
304
return
_f
.EnsureNodeSet(right);
306
left =
_f
.EnsureNodeSet(left);
307
right =
_f
.EnsureNodeSet(right);
315
return
_f
.Union(left, right);
337
return
_f
.Sequence();
344
qilAxis =
_f
.Filter(itr =
_f
.For(qilAxis),
_f
.IsType(itr, T.NodeChoice(required)));
358
filter.Body =
_f
.And(filter.Body,
359
name != null && nsUri != null ?
_f
.Eq(
_f
.NameOf(itr),
_f
.QName(name, nsUri)) : // ns:bar || bar
360
nsUri != null ?
_f
.Eq(
_f
.NamespaceUriOf(itr),
_f
.String(nsUri)) : // ns:*
361
name != null ?
_f
.Eq(
_f
.LocalNameOf(itr),
_f
.String(name)) : // *:foo
362
/*name == nsUri == null*/
_f
.True() // *
368
return
_f
.Filter(itr =
_f
.For(qilAxis),
369
name != null && nsUri != null ?
_f
.Eq(
_f
.NameOf(itr),
_f
.QName(name, nsUri)) : // ns:bar || bar
370
nsUri != null ?
_f
.Eq(
_f
.NamespaceUriOf(itr),
_f
.String(nsUri)) : // ns:*
371
name != null ?
_f
.Eq(
_f
.LocalNameOf(itr),
_f
.String(name)) : // *:foo
372
/*name == nsUri == null*/
_f
.True() // *
397
case XPathAxis.Ancestor: qilAxis =
_f
.Ancestor(currentNode); break;
398
case XPathAxis.AncestorOrSelf: qilAxis =
_f
.AncestorOrSelf(currentNode); break;
399
case XPathAxis.Attribute: qilAxis =
_f
.Content(currentNode); break;
400
case XPathAxis.Child: qilAxis =
_f
.Content(currentNode); break;
401
case XPathAxis.Descendant: qilAxis =
_f
.Descendant(currentNode); break;
402
case XPathAxis.DescendantOrSelf: qilAxis =
_f
.DescendantOrSelf(currentNode); break;
403
case XPathAxis.Following: qilAxis =
_f
.XPathFollowing(currentNode); break;
404
case XPathAxis.FollowingSibling: qilAxis =
_f
.FollowingSibling(currentNode); break;
405
case XPathAxis.Namespace: qilAxis =
_f
.XPathNamespace(currentNode); break;
406
case XPathAxis.Parent: qilAxis =
_f
.Parent(currentNode); break;
407
case XPathAxis.Preceding: qilAxis =
_f
.XPathPreceding(currentNode); break;
408
case XPathAxis.PrecedingSibling: qilAxis =
_f
.PrecedingSibling(currentNode); break;
411
case XPathAxis.Root: return
_f
.Root(currentNode);
424
result =
_f
.BaseFactory.DocOrderDistinct(result);
442
QilIterator leftIt =
_f
.For(
_f
.EnsureNodeSet(left));
448
return
_f
.DocOrderDistinct(
_f
.Loop(leftIt, right));
466
predicate = PredicateToBoolean(predicate,
_f
, this);
468
return BuildOnePredicate(nodeset, predicate, isReverseStep,
_f
, _fixupVisitor, ref numFixupCurrent, ref numFixupPosition, ref numFixupLast);
567
func.CastArguments(args, name,
_f
);
571
case FuncId.Not: return
_f
.Not(args[0]);
574
case FuncId.Count: return
_f
.XsltConvert(
_f
.Length(
_f
.DocOrderDistinct(args[0])), T.DoubleX);
575
case FuncId.LocalName: return args.Count == 0 ?
_f
.LocalNameOf(GetCurrentNode()) : LocalNameOfFirstNode(args[0]);
576
case FuncId.NamespaceUri: return args.Count == 0 ?
_f
.NamespaceUriOf(GetCurrentNode()) : NamespaceOfFirstNode(args[0]);
578
case FuncId.String: return args.Count == 0 ?
_f
.XPathNodeValue(GetCurrentNode()) :
_f
.ConvertToString(args[0]);
579
case FuncId.Number: return args.Count == 0 ?
_f
.XsltConvert(
_f
.XPathNodeValue(GetCurrentNode()), T.DoubleX) :
_f
.ConvertToNumber(args[0]);
580
case FuncId.Boolean: return
_f
.ConvertToBoolean(args[0]);
581
case FuncId.True: return
_f
.True();
582
case FuncId.False: return
_f
.False();
583
case FuncId.Id: return
_f
.DocOrderDistinct(
_f
.Id(GetCurrentNode(), args[0]));
584
case FuncId.Concat: return
_f
.StrConcat(args);
585
case FuncId.StartsWith: return
_f
.InvokeStartsWith(args[0], args[1]);
586
case FuncId.Contains: return
_f
.InvokeContains(args[0], args[1]);
587
case FuncId.SubstringBefore: return
_f
.InvokeSubstringBefore(args[0], args[1]);
588
case FuncId.SubstringAfter: return
_f
.InvokeSubstringAfter(args[0], args[1]);
590
return args.Count == 2 ?
_f
.InvokeSubstring(args[0], args[1]) :
_f
.InvokeSubstring(args[0], args[1], args[2]);
592
return
_f
.XsltConvert(
_f
.StrLength(args.Count == 0 ?
_f
.XPathNodeValue(GetCurrentNode()) : args[0]), T.DoubleX);
594
return
_f
.InvokeNormalizeSpace(args.Count == 0 ?
_f
.XPathNodeValue(GetCurrentNode()) : args[0]);
595
case FuncId.Translate: return
_f
.InvokeTranslate(args[0], args[1], args[2]);
596
case FuncId.Lang: return
_f
.InvokeLang(args[0], GetCurrentNode());
597
case FuncId.Sum: return Sum(
_f
.DocOrderDistinct(args[0]));
598
case FuncId.Floor: return
_f
.InvokeFloor(args[0]);
599
case FuncId.Ceiling: return
_f
.InvokeCeiling(args[0]);
600
case FuncId.Round: return
_f
.InvokeRound(args[0]);
616
return
_f
.LocalNameOf(arg);
621
return
_f
.StrConcat(
_f
.Loop(i =
_f
.FirstNode(arg),
_f
.LocalNameOf(i)));
630
return
_f
.NamespaceUriOf(arg);
635
return
_f
.StrConcat(
_f
.Loop(i =
_f
.FirstNode(arg),
_f
.NamespaceUriOf(i)));
646
return
_f
.Loop(p =
_f
.Let(
_f
.PrefixOf(arg)),
_f
.Loop(ln =
_f
.Let(
_f
.LocalNameOf(arg)),
647
_f
.Conditional(
_f
.Eq(
_f
.StrLength(p),
_f
.Int32(0)), ln,
_f
.StrConcat(p,
_f
.String(":"), ln)
652
QilIterator let =
_f
.Let(arg);
653
return
_f
.Loop(let, /*recursion:*/NameOf(let));
667
return
_f
.StrConcat(
_f
.Loop(i =
_f
.FirstNode(arg), NameOf(i)));
675
return
_f
.Sum(
_f
.Sequence(
_f
.Double(0d),
_f
.Loop(i =
_f
.For(arg),
_f
.ConvertToNumber(i))));