Re: [go-nuts] Are there alternatives to lower & upper bound or partition_point

Check out https://pkg.go.dev/github.com/liyue201/gostl@v1.2.0/algorithm/sort but you could just as easily write those functions - they’re fairly trivial. Almost all of the C++ STL is implemented. > On Oct 10, 2024, at 3:50 PM,

Re: [go-nuts] Are there alternatives to lower & upper bound or partition_point

On Thu, Oct 10, 2024 at 2:01 PM 'lijh8' via golang-nuts 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_bou