src/server/pkg/hashtree/sorted_list.go
func removeStr(ss *[]string, s string) bool {
	idx := sort.SearchStrings(*ss, s)
	if idx == len(*ss) {
		return false
	}
	copy((*ss)[idx:], (*ss)[idx+1:])
	*ss = (*ss)[:len(*ss)-1]
	return true
}
func removeStr(ss *[]string, s string) bool {
	idx := sort.SearchStrings(*ss, s)
	if idx == len(*ss) {
		return false
	}
	copy((*ss)[idx:], (*ss)[idx+1:])
	*ss = (*ss)[:len(*ss)-1]
	return true
}
func removeStr ( ss * [ ] string , s string ) bool { idx := sort . SearchStrings ( * ss , s ) if idx == len ( * ss ) { return false } copy ( ( * ss ) [ idx : ] , ( * ss ) [ idx + 1 : ] ) * ss = ( * ss ) [ : len ( * ss ) - 1 ] return true }
// removeStr removes 's' from 'ss', preserving the sorted order of 'ss' (for
// removing child strings from DirectoryNodes.
removeStr removes s from ss preserving the sorted order of ss ( for removing child strings from DirectoryNodes .