On Thu, Oct 10, 2024 at 2:01 PM 'lijh8' via golang-nuts <golang-nuts@googlegroups.com> wrote: > > Are there alternatives to lower & upper bound or partition_point > > Suppose there duplicate entries in a slice. > I need to use a loop to find out the upper bound on a sorted slice. > > Are there something similar to c++ lower_bound, upper_bound, partition_point?
Those don't currently exist in the Go standard library. Ian -- You received this message because you are subscribed to the Google Groups "golang-nuts" group. To unsubscribe from this group and stop receiving emails from it, send an email to golang-nuts+unsubscr...@googlegroups.com. To view this discussion on the web visit https://groups.google.com/d/msgid/golang-nuts/CAOyqgcVNYFxtxS3Dx4c0%2Bg%2BusTFD7o%3Dk2o-%2BvEjeTRr9RmSB8Q%40mail.gmail.com.
