Le

13 references to Le

System.Data.SqlXml (13)

System\Xml\Xsl\IlGen\XmlILOptimizerVisitor.cs (3)

1845return Replace(XmlILOptimization.EliminateLe, local0, FoldComparison(QilNodeType.Le, local1, local2) ); 2330if (local2.NodeType == QilNodeType.Le) { 4184case QilNodeType.Le: return cmp <= 0 ? f.True() : f.False();

System\Xml\Xsl\IlGen\XmlIlVisitor.cs (4)

3989case QilNodeType.Le: opcode = OpCodes.Bgt_Un; break; 4001case QilNodeType.Le: opcode = OpCodes.Bgt; break; 4016case QilNodeType.Le: opcode = OpCodes.Ble; break; 4034case QilNodeType.Le: opcode = OpCodes.Ble_S; break;

System\Xml\Xsl\QIL\QilFactory.cs (1)

569QilBinary n = new QilBinary(QilNodeType.Le, left, right);

System\Xml\Xsl\QIL\QilTypeChecker.cs (1)

97case QilNodeType.Le: return CheckLe((QilBinary)n);

System\Xml\Xsl\QIL\QilVisitor.cs (1)

169case QilNodeType.Le: return VisitLe((QilBinary)n);

System\Xml\Xsl\XPath\XPathBuilder.cs (1)

616/*Le */ QilNodeType.Le ,

System\Xml\Xsl\XPath\XPathQilFactory.cs (2)

138Debug.Assert(op == QilNodeType.Lt || op == QilNodeType.Le || op == QilNodeType.Gt || op == QilNodeType.Ge); 145case QilNodeType.Le: opCode = (double)XsltLibrary.ComparisonOperator.Le; break;