[#llvm-operator_le-0f01] = xref:llvm.adoc[llvm]::operator<= :relfileprefix: ../ :mrdocs: Less‐than‐or‐equal operators == Synopses Declared in `<llvm/ADT/DynamicAPInt.h>` Return true if `L` is less than or equal to `R.` [source,cpp,subs="verbatim,replacements,macros,-callouts"] ---- template<class DigitsT> bool xref:llvm/operator_le-0c.adoc[operator<=]( xref:llvm/ScaledNumber.adoc[ScaledNumber<DigitsT>] const& L, uint64_t R); ---- [.small]#xref:llvm/operator_le-0c.adoc[_» more..._]# Returns true if `A` is less than or equal to `B.` [source,cpp,subs="verbatim,replacements,macros,-callouts"] ---- bool xref:llvm/operator_le-0029.adoc[operator<=]( xref:llvm/DynamicAPInt.adoc[DynamicAPInt] const& A, int64_t B); ---- [.small]#xref:llvm/operator_le-0029.adoc[_» more..._]# Returns true if `A` is less than or equal to `B.` [source,cpp,subs="verbatim,replacements,macros,-callouts"] ---- bool xref:llvm/operator_le-04.adoc[operator<=]( int64_t A, xref:llvm/DynamicAPInt.adoc[DynamicAPInt] const& B); ---- [.small]#xref:llvm/operator_le-04.adoc[_» more..._]# Order wrappers by raw location metadata pointer address. [source,cpp,subs="verbatim,replacements,macros,-callouts"] ---- bool xref:llvm/operator_le-0f7.adoc[operator<=]( xref:llvm/RawLocationWrapper.adoc[RawLocationWrapper] const& A, xref:llvm/RawLocationWrapper.adoc[RawLocationWrapper] const& B); ---- [.small]#xref:llvm/operator_le-0f7.adoc[_» more..._]# Return true if `L` is less than or equal to `R.` [source,cpp,subs="verbatim,replacements,macros,-callouts"] ---- template<class DigitsT> bool xref:llvm/operator_le-08e.adoc[operator<=]( int32_t L, xref:llvm/ScaledNumber.adoc[ScaledNumber<DigitsT>] const& R); ---- [.small]#xref:llvm/operator_le-08e.adoc[_» more..._]# Return true if `L` is less than or equal to `R.` [source,cpp,subs="verbatim,replacements,macros,-callouts"] ---- template<class DigitsT> bool xref:llvm/operator_le-06.adoc[operator<=]( xref:llvm/ScaledNumber.adoc[ScaledNumber<DigitsT>] const& L, int32_t R); ---- [.small]#xref:llvm/operator_le-06.adoc[_» more..._]# Return true if `L` is less than or equal to `R.` [source,cpp,subs="verbatim,replacements,macros,-callouts"] ---- template<class DigitsT> bool xref:llvm/operator_le-000.adoc[operator<=]( int64_t L, xref:llvm/ScaledNumber.adoc[ScaledNumber<DigitsT>] const& R); ---- [.small]#xref:llvm/operator_le-000.adoc[_» more..._]# Return true if `L` is less than or equal to `R.` [source,cpp,subs="verbatim,replacements,macros,-callouts"] ---- template<class DigitsT> bool xref:llvm/operator_le-02.adoc[operator<=]( xref:llvm/ScaledNumber.adoc[ScaledNumber<DigitsT>] const& L, int64_t R); ---- [.small]#xref:llvm/operator_le-02.adoc[_» more..._]# Return true if `L` is less than or equal to `R.` [source,cpp,subs="verbatim,replacements,macros,-callouts"] ---- template<class DigitsT> bool xref:llvm/operator_le-07.adoc[operator<=]( uint32_t L, xref:llvm/ScaledNumber.adoc[ScaledNumber<DigitsT>] const& R); ---- [.small]#xref:llvm/operator_le-07.adoc[_» more..._]# Return true if `L` is less than or equal to `R.` [source,cpp,subs="verbatim,replacements,macros,-callouts"] ---- template<class DigitsT> bool xref:llvm/operator_le-0ad.adoc[operator<=]( xref:llvm/ScaledNumber.adoc[ScaledNumber<DigitsT>] const& L, uint32_t R); ---- [.small]#xref:llvm/operator_le-0ad.adoc[_» more..._]# Return true if `L` is less than or equal to `R.` [source,cpp,subs="verbatim,replacements,macros,-callouts"] ---- template<class DigitsT> bool xref:llvm/operator_le-03.adoc[operator<=]( uint64_t L, xref:llvm/ScaledNumber.adoc[ScaledNumber<DigitsT>] const& R); ---- [.small]#xref:llvm/operator_le-03.adoc[_» more..._]# Return true if `LHS` is lexicographically less than or equal to `RHS.` [source,cpp,subs="verbatim,replacements,macros,-callouts"] ---- bool xref:llvm/operator_le-0ef.adoc[operator<=]( xref:llvm/StringRef.adoc[StringRef] LHS, xref:llvm/StringRef.adoc[StringRef] RHS); ---- [.small]#xref:llvm/operator_le-0ef.adoc[_» more..._]# Deleted; LLVM atomic orders form a lattice, not a total order. [source,cpp,subs="verbatim,replacements,macros,-callouts"] ---- bool xref:llvm/operator_le-0ac.adoc[operator<=]( xref:llvm/AtomicOrdering.adoc[AtomicOrdering] Lhs, xref:llvm/AtomicOrdering.adoc[AtomicOrdering] Rhs) = delete; ---- [.small]#xref:llvm/operator_le-0ac.adoc[_» more..._]# Deleted; CABI atomic orders form a lattice, not a total order. [source,cpp,subs="verbatim,replacements,macros,-callouts"] ---- bool xref:llvm/operator_le-005.adoc[operator<=]( xref:llvm/AtomicOrderingCABI.adoc[AtomicOrderingCABI] Lhs, xref:llvm/AtomicOrderingCABI.adoc[AtomicOrderingCABI] Rhs) = delete; ---- [.small]#xref:llvm/operator_le-005.adoc[_» more..._]# Compare a signed 64‐bit value with an APSInt for less‐or‐equal. [source,cpp,subs="verbatim,replacements,macros,-callouts"] ---- bool xref:llvm/operator_le-05d.adoc[operator<=]( int64_t V1, xref:llvm/APSInt.adoc[APSInt] const& V2); ---- [.small]#xref:llvm/operator_le-05d.adoc[_» more..._]# Determine whether one version number precedes or is equivalent to another. [source,cpp,subs="verbatim,replacements,macros,-callouts"] ---- bool xref:llvm/operator_le-0fc.adoc[operator<=]( xref:llvm/VersionTuple.adoc[VersionTuple] const& X, xref:llvm/VersionTuple.adoc[VersionTuple] const& Y); ---- [.small]#xref:llvm/operator_le-0fc.adoc[_» more..._]# Relational less‐or‐equal is deleted for MaybeAlign vs MaybeAlign. [source,cpp,subs="verbatim,replacements,macros,-callouts"] ---- bool xref:llvm/operator_le-082.adoc[operator<=]( xref:llvm/MaybeAlign.adoc[MaybeAlign] Lhs, xref:llvm/MaybeAlign.adoc[MaybeAlign] Rhs) = delete; ---- [.small]#xref:llvm/operator_le-082.adoc[_» more..._]# Relational less‐or‐equal is deleted for MaybeAlign vs Align. [source,cpp,subs="verbatim,replacements,macros,-callouts"] ---- bool xref:llvm/operator_le-0ea.adoc[operator<=]( xref:llvm/MaybeAlign.adoc[MaybeAlign] Lhs, xref:llvm/Align.adoc[Align] Rhs) = delete; ---- [.small]#xref:llvm/operator_le-0ea.adoc[_» more..._]# Relational less‐or‐equal is deleted for Align vs MaybeAlign. [source,cpp,subs="verbatim,replacements,macros,-callouts"] ---- bool xref:llvm/operator_le-002c.adoc[operator<=]( xref:llvm/Align.adoc[Align] Lhs, xref:llvm/MaybeAlign.adoc[MaybeAlign] Rhs) = delete; ---- [.small]#xref:llvm/operator_le-002c.adoc[_» more..._]# Return true if alignment `Lhs` is less than or equal to byte count `Rhs.` [source,cpp,subs="verbatim,replacements,macros,-callouts"] ---- bool xref:llvm/operator_le-09.adoc[operator<=]( xref:llvm/Align.adoc[Align] Lhs, uint64_t Rhs); ---- [.small]#xref:llvm/operator_le-09.adoc[_» more..._]# Return true if `LHS` is lexicographically less than or equal to `RHS.` [source,cpp,subs="verbatim,replacements,macros,-callouts"] ---- template<typename T> bool xref:llvm/operator_le-05c.adoc[operator<=]( xref:llvm/ArrayRef-08.adoc[ArrayRef<T>] LHS, xref:llvm/ArrayRef-08.adoc[ArrayRef<T>] RHS); ---- [.small]#xref:llvm/operator_le-05c.adoc[_» more..._]# Return true if alignment `Lhs` is less than or equal to `Rhs.` [source,cpp,subs="verbatim,replacements,macros,-callouts"] ---- bool xref:llvm/operator_le-0f0b.adoc[operator<=]( xref:llvm/Align.adoc[Align] Lhs, xref:llvm/Align.adoc[Align] Rhs); ---- [.small]#xref:llvm/operator_le-0f0b.adoc[_» more..._]# == Return Value * True if `L` is less than or equal to `R.` * True if `A` is less than or equal to `B.` * True if `A` orders before or equal to `B` by raw location metadata pointer address. * True if `LHS` is lexicographically less than or equal to `RHS.` * true if `V1` is less than or equal to `V2` * `true` if `X` is less than or equal to `Y.` * True if `Lhs` is less than or equal to `Rhs` bytes. * True if `Lhs` is less than or equal to `Rhs.` == Parameters [cols="1,4"] |=== | Name| Description | *L* | Left‐hand operand. | *R* | Right‐hand operand. | *A* | Left‐hand operand. | *B* | Right‐hand operand. | *LHS* | Left‐hand StringRef. | *RHS* | Right‐hand StringRef. | *Lhs* | Left‐hand LLVM atomic ordering. | *Rhs* | Right‐hand LLVM atomic ordering. | *V1* | signed 64‐bit left‐hand operand | *V2* | APSInt right‐hand operand | *X* | Left‐hand version. | *Y* | Right‐hand version. |=== [.small]#Created with https://www.mrdocs.com[MrDocs]#