Hi community,
I improved my binary search example with both sort.Search and sort.Find.
Please correct me if I got new wrongs with new example.
1.
My original question was if there are duplicate entries in sorted slice.
After I located the first dup, how can I go to the rest of them without
Hi community,
I used sort.Search on a sorted slice in below code started at Line 36, and it
worked.
I also tried to call sort.Search in a loop, started at Line 53. It does not
seem to work. How can I correct the loop version?
Thanks
---
package main
import (
"log"
"sor
Thanks Ian,
There is no official proxy / mirror sites by core team, right?
--
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.
Hi, community,
I Just saw this site: yunzhanghu.com , is listed as Special Sponsor on
goproxy.io homepage.
I'm just curious, is goproxy.io endorsed by The Go Team and is goproxy.io
trustworthy?
$ whois goproxy.io
Registrant Name: REDACTED FOR PRIVACY
--
You received this message because
Just found another, are these two sites related:
goproxy.io , goproxy.cn .
--
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.c