mir-algorithm ~master (2021-09-24T13:11:04Z)

mir_series.lowerBound

mir series mir_series

This function uses a search with policy sp to find the largest left subrange on which t < key is true for all t. The search schedule and its complexity are documented in std.range.SearchPolicy.

  1. auto lowerBound(Index key)
    struct mir_series(IndexIterator_, Iterator_, size_t N_ = 1, SliceKind kind_ = Contiguous)
    @optmath
    auto
    lowerBound
    (
    Index
    )
    (
    auto ref scope const Index key
    )
  2. auto lowerBound(Index key)

Meta

Source

See Implementation

mir series mir_series aliasesconstructorsfunctionsvariables

Page generated by adrdox