llvm::operator<

Synopses

Declared in <llvm/ADT/DynamicAPInt.h>

Compare two adapted iterators for order.

bool
operator<(
    iterator_adaptor_base<iterator, Edge*, forward_iterator_tag> const& LHS,
    iterator_adaptor_base<iterator, Edge*, forward_iterator_tag> const& RHS);

» more...

Order ValueInfos by GUID.

bool
operator<(
    ValueInfo const& A,
    ValueInfo const& B);

» more...

Order by section index, then LowPC, then HighPC.

bool
operator<(
    DWARFAddressRange const& LHS,
    DWARFAddressRange const& RHS);

» more...

True if LHS's section offset is less than RHS's.

bool
operator<(
    DWARFDie const& LHS,
    DWARFDie const& RHS);

» more...

Compare two adapted iterators for order.

bool
operator<(
    iterator_adaptor_base<MCRegUnitIterator, DiffListIterator, forward_iterator_tag, MCRegUnit const> const& LHS,
    iterator_adaptor_base<MCRegUnitIterator, DiffListIterator, forward_iterator_tag, MCRegUnit const> const& RHS);

» more...

Compare two adapted iterators for order.

bool
operator<(
    iterator_adaptor_base<MCSuperRegIterator, DiffListIterator, forward_iterator_tag, unsigned short const> const& LHS,
    iterator_adaptor_base<MCSuperRegIterator, DiffListIterator, forward_iterator_tag, unsigned short const> const& RHS);

» more...

Compare two adapted iterators for order.

bool
operator<(
    iterator_adaptor_base<MCSubRegIterator, DiffListIterator, forward_iterator_tag, unsigned short const> const& LHS,
    iterator_adaptor_base<MCSubRegIterator, DiffListIterator, forward_iterator_tag, unsigned short const> const& RHS);

» more...

Order two symbol infos for section listing and mapping-symbol placement.

bool
operator<(
    SymbolInfoTy const& P1,
    SymbolInfoTy const& P2);

» more...

Return true if this value orders before the other.

bool
operator<(
    DIExpression::FragmentInfo const& A,
    DIExpression::FragmentInfo const& B);

» more...

Compare two adapted iterators for order.

bool
operator<(
    iterator_adaptor_base<GSIHashIterator, FixedStreamArrayIterator<PSHashRecord>, random_access_iterator_tag, unsigned int const> const& LHS,
    iterator_adaptor_base<GSIHashIterator, FixedStreamArrayIterator<PSHashRecord>, random_access_iterator_tag, unsigned int const> const& RHS);

» more...

Compare two adapted iterators for order.

bool
operator<(
    iterator_adaptor_base<call_iterator, DenseMapIterator<CallInst*, unsigned int>> const& LHS,
    iterator_adaptor_base<call_iterator, DenseMapIterator<CallInst*, unsigned int>> const& RHS);

» more...

Order wrappers by raw location metadata pointer address.

bool
operator<(
    RawLocationWrapper const& A,
    RawLocationWrapper const& B);

» more...

Return true if L is strictly less than R.

template<class DigitsT>
bool
operator<(
    int32_t L,
    ScaledNumber<DigitsT> const& R);

» more...

Compare two adapted iterators for order.

bool
operator<(
    iterator_adaptor_base<call_iterator, Edge*, forward_iterator_tag> const& LHS,
    iterator_adaptor_base<call_iterator, Edge*, forward_iterator_tag> const& RHS);

» more...

Compare two adapted iterators for order.

bool
operator<(
    iterator_adaptor_base<AACallEdgeIterator, Function const**> const& LHS,
    iterator_adaptor_base<AACallEdgeIterator, Function const**> const& RHS);

» more...

Compare two adapted iterators for order.

bool
operator<(
    iterator_adaptor_base<const_value_iterator, const_iterator, forward_iterator_tag, DIEValue const> const& LHS,
    iterator_adaptor_base<const_value_iterator, const_iterator, forward_iterator_tag, DIEValue const> const& RHS);

» more...

Compare two adapted iterators for order.

bool
operator<(
    iterator_adaptor_base<value_iterator, iterator, forward_iterator_tag, DIEValue> const& LHS,
    iterator_adaptor_base<value_iterator, iterator, forward_iterator_tag, DIEValue> const& RHS);

» more...

Compare two adapted iterators for order.

bool
operator<(
    iterator_adaptor_base<const_symbol_iterator, DenseMapIterator<SymbolsMapKey, Symbol*>, forward_iterator_tag, Symbol const*, long, Symbol const*, Symbol const*> const& LHS,
    iterator_adaptor_base<const_symbol_iterator, DenseMapIterator<SymbolsMapKey, Symbol*>, forward_iterator_tag, Symbol const*, long, Symbol const*, Symbol const*> const& RHS);

» more...

Return true if slot index V is before segment S.

bool
operator<(
    SlotIndex V,
    LiveRange::Segment const& S);

» more...

Return true if segment S starts before slot index V.

bool
operator<(
    LiveRange::Segment const& S,
    SlotIndex V);

» more...

Compare two adapted iterators for order.

bool
operator<(
    iterator_adaptor_base<value_op_iterator, SDUse*, random_access_iterator_tag, SDValue, long, value_op_iterator*, value_op_iterator*> const& LHS,
    iterator_adaptor_base<value_op_iterator, SDUse*, random_access_iterator_tag, SDValue, long, value_op_iterator*, value_op_iterator*> const& RHS);

» more...

Returns true if A is less than B.

bool
operator<(
    int64_t A,
    DynamicAPInt const& B);

» more...

Returns true if A is less than B.

bool
operator<(
    DynamicAPInt const& A,
    int64_t B);

» more...

Compare two adapted iterators for order.

bool
operator<(
    iterator_adaptor_base<WrappedSuccIterator, succ_iterator, random_access_iterator_tag, pair<Loop const*, BasicBlock*>, long, pair<Loop const*, BasicBlock*>*, pair<Loop const*, BasicBlock*>> const& LHS,
    iterator_adaptor_base<WrappedSuccIterator, succ_iterator, random_access_iterator_tag, pair<Loop const*, BasicBlock*>, long, pair<Loop const*, BasicBlock*>*, pair<Loop const*, BasicBlock*>> const& RHS);

» more...

Order unions by their opaque bit patterns.

bool
operator<(
    PointerUnion lhs,
    PointerUnion rhs);

» more...

Return true if LHS is lexicographically less than RHS.

bool
operator<(
    StringRef LHS,
    StringRef RHS);

» more...

Return true if alignment Lhs is strictly less than Rhs.

bool
operator<(
    Align Lhs,
    Align Rhs);

» more...

Lexicographically compare two ArrayRefs.

template<typename T>
bool
operator<(
    ArrayRef<T> LHS,
    ArrayRef<T> RHS);

» more...

Return true if alignment Lhs is strictly less than byte count Rhs.

bool
operator<(
    Align Lhs,
    uint64_t Rhs);

» more...

Relational less-than is deleted for Align vs MaybeAlign.

bool
operator<(
    Align Lhs,
    MaybeAlign Rhs) = delete;

» more...

Relational less-than is deleted for MaybeAlign vs Align.

bool
operator<(
    MaybeAlign Lhs,
    Align Rhs) = delete;

» more...

Relational less-than is deleted for MaybeAlign vs MaybeAlign.

bool
operator<(
    MaybeAlign Lhs,
    MaybeAlign Rhs) = delete;

» more...

Compare two adapted iterators for order.

bool
operator<(
    iterator_adaptor_base<value_op_iterator, Use*, random_access_iterator_tag, Value*, long, Value*, Value*> const& LHS,
    iterator_adaptor_base<value_op_iterator, Use*, random_access_iterator_tag, Value*, long, Value*, Value*> const& RHS);

» more...

Compare two adapted iterators for order.

bool
operator<(
    iterator_adaptor_base<const_value_op_iterator, Use const*, random_access_iterator_tag, Value const*, long, Value const*, Value const*> const& LHS,
    iterator_adaptor_base<const_value_op_iterator, Use const*, random_access_iterator_tag, Value const*, long, Value const*, Value const*> const& RHS);

» more...

Determine whether one version number precedes another.

bool
operator<(
    VersionTuple const& X,
    VersionTuple const& Y);

» more...

Compare a signed 64-bit value with an APSInt for less-than.

bool
operator<(
    int64_t V1,
    APSInt const& V2);

» more...

Compare two adapted iterators for order.

bool
operator<(
    iterator_adaptor_base const& LHS,
    iterator_adaptor_base const& RHS);

» more...

Compare two adapted iterators for order.

bool
operator<(
    iterator_adaptor_base<succ_iterator, Use*, random_access_iterator_tag, BasicBlock*, long, BasicBlock*, BasicBlock*> const& LHS,
    iterator_adaptor_base<succ_iterator, Use*, random_access_iterator_tag, BasicBlock*, long, BasicBlock*, BasicBlock*> const& RHS);

» more...

Compare two adapted iterators for order.

bool
operator<(
    iterator_adaptor_base<const_succ_iterator, Use const*, random_access_iterator_tag, BasicBlock const*, long, BasicBlock const*, BasicBlock const*> const& LHS,
    iterator_adaptor_base<const_succ_iterator, Use const*, random_access_iterator_tag, BasicBlock const*, long, BasicBlock const*, BasicBlock const*> const& RHS);

» more...

Ordering comparisons are deleted because C++ memory orders form a lattice, not a linear order; use isAtLeastOrStrongerThan instead.

bool
operator<(
    AtomicOrderingCABI Lhs,
    AtomicOrderingCABI Rhs) = delete;

» more...

Deleted; LLVM atomic orders form a lattice, not a total order.

bool
operator<(
    AtomicOrdering Lhs,
    AtomicOrdering Rhs) = delete;

» more...

Return true if L is strictly less than R.

template<class DigitsT>
bool
operator<(
    ScaledNumber<DigitsT> const& L,
    uint64_t R);

» more...

Return true if L is strictly less than R.

template<class DigitsT>
bool
operator<(
    uint64_t L,
    ScaledNumber<DigitsT> const& R);

» more...

Return true if L is strictly less than R.

template<class DigitsT>
bool
operator<(
    ScaledNumber<DigitsT> const& L,
    uint32_t R);

» more...

Return true if L is strictly less than R.

template<class DigitsT>
bool
operator<(
    uint32_t L,
    ScaledNumber<DigitsT> const& R);

» more...

Return true if L is strictly less than R.

template<class DigitsT>
bool
operator<(
    ScaledNumber<DigitsT> const& L,
    int64_t R);

» more...

Return true if L is strictly less than R.

template<class DigitsT>
bool
operator<(
    int64_t L,
    ScaledNumber<DigitsT> const& R);

» more...

Return true if L is strictly less than R.

template<class DigitsT>
bool
operator<(
    ScaledNumber<DigitsT> const& L,
    int32_t R);

» more...