- Sort Score
- Result 10 results
- Languages All
Results 1 - 1 of 1 for sortSearch (0.08 sec)
-
src/embed/embed.go
return nil } // Binary search to find where dir starts and ends in the list // and then return that slice of the list. files := *f.files i := sortSearch(len(files), func(i int) bool { idir, _, _ := split(files[i].name) return idir >= dir }) j := sortSearch(len(files), func(j int) bool { jdir, _, _ := split(files[j].name) return jdir > dir }) return files[i:j] }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 20 19:42:51 UTC 2024 - 13.5K bytes - Viewed (0)